Please use this identifier to cite or link to this item: http://hdl.handle.net/11422/2593
Full metadata record
DC FieldValueLanguage
dc.contributor.authorProtti, Fábio-
dc.contributor.authorSzwarcfiter, Jayme Luiz-
dc.contributor.authorFrança, Felipe Maia Galvão-
dc.date.accessioned2017-08-04T13:06:13Z-
dc.date.available2017-08-06T03:00:16Z-
dc.date.issued1997-12-31-
dc.identifier.citationPROTTI, F.; FRANÇA, F. M. G.; SZWARCFITER, J. L. On computing all maximal cliques distributedly. Rio de Janeiro: NCE, UFRJ, 1997. 12 p. (Relatório Técnico, 01/97)pt_BR
dc.identifier.urihttp://hdl.handle.net/11422/2593-
dc.description.abstractA distributed algorithm is presented for generating all maximal cIiques in a network graph, based on the sequential version of Tsukiyama et al. [TIAS77]. The time complexity of the proposed approach is restricted to the induced neighborhood of a node, and the communication complexity is O( md) where m is the number of connections, and d is the maximum degree in the graph. Messages are O(log n ) bits long, where n is the number of nodes (processors) in the system. As an appIication, a distributed algorithm for constructing the clique graph k( G) from a given network graph G is developed within the scope of dynamic transformations of topologies.en
dc.languageengpt_BR
dc.relation.ispartofRelatório Técnico NCEpt_BR
dc.rightsAcesso Abertopt_BR
dc.subjectAlgoritmospt_BR
dc.subjectSistemas distribuídospt_BR
dc.subjectDistributed algoritmsen
dc.titleOn computing all maximal cliques distributedlyen
dc.typeRelatóriopt_BR
dc.publisher.countryBrasilpt_BR
dc.publisher.departmentInstituto Tércio Pacitti de Aplicações e Pesquisas Computacionaispt_BR
dc.subject.cnpqCNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO::SISTEMAS DE COMPUTACAOpt_BR
dc.citation.issue0197pt_BR
dc.embargo.termsabertopt_BR
Appears in Collections:Relatórios

Files in This Item:
File Description SizeFormat 
01_97_000575773.pdf636.33 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.