On computing all maximal cliques distributedly

Detalhes bibliográficos
Autor(a) principal: Protti, Fábio
Data de Publicação: 1997
Outros Autores: Szwarcfiter, Jayme Luiz, França, Felipe Maia Galvão
Tipo de documento: Relatório
Idioma: eng
Título da fonte: Repositório Institucional da UFRJ
Texto Completo: http://hdl.handle.net/11422/2593
Resumo: A 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.
id UFRJ_608ad4ca25527fb9f050ed9c1eaeb162
oai_identifier_str oai:pantheon.ufrj.br:11422/2593
network_acronym_str UFRJ
network_name_str Repositório Institucional da UFRJ
repository_id_str
spelling On computing all maximal cliques distributedlyAlgoritmosSistemas distribuídosDistributed algoritmsCNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO::SISTEMAS DE COMPUTACAOA 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.BrasilInstituto Tércio Pacitti de Aplicações e Pesquisas Computacionais2017-08-04T13:06:13Z2023-12-21T03:03:26Z1997-12-31info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/reportPROTTI, 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)http://hdl.handle.net/11422/2593engRelatório Técnico NCEProtti, FábioSzwarcfiter, Jayme LuizFrança, Felipe Maia Galvãoinfo:eu-repo/semantics/openAccessreponame:Repositório Institucional da UFRJinstname:Universidade Federal do Rio de Janeiro (UFRJ)instacron:UFRJ2023-12-21T03:03:26Zoai:pantheon.ufrj.br:11422/2593Repositório InstitucionalPUBhttp://www.pantheon.ufrj.br/oai/requestpantheon@sibi.ufrj.bropendoar:2023-12-21T03:03:26Repositório Institucional da UFRJ - Universidade Federal do Rio de Janeiro (UFRJ)false
dc.title.none.fl_str_mv On computing all maximal cliques distributedly
title On computing all maximal cliques distributedly
spellingShingle On computing all maximal cliques distributedly
Protti, Fábio
Algoritmos
Sistemas distribuídos
Distributed algoritms
CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO::SISTEMAS DE COMPUTACAO
title_short On computing all maximal cliques distributedly
title_full On computing all maximal cliques distributedly
title_fullStr On computing all maximal cliques distributedly
title_full_unstemmed On computing all maximal cliques distributedly
title_sort On computing all maximal cliques distributedly
author Protti, Fábio
author_facet Protti, Fábio
Szwarcfiter, Jayme Luiz
França, Felipe Maia Galvão
author_role author
author2 Szwarcfiter, Jayme Luiz
França, Felipe Maia Galvão
author2_role author
author
dc.contributor.author.fl_str_mv Protti, Fábio
Szwarcfiter, Jayme Luiz
França, Felipe Maia Galvão
dc.subject.por.fl_str_mv Algoritmos
Sistemas distribuídos
Distributed algoritms
CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO::SISTEMAS DE COMPUTACAO
topic Algoritmos
Sistemas distribuídos
Distributed algoritms
CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO::SISTEMAS DE COMPUTACAO
description A 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.
publishDate 1997
dc.date.none.fl_str_mv 1997-12-31
2017-08-04T13:06:13Z
2023-12-21T03:03:26Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/report
format report
status_str publishedVersion
dc.identifier.uri.fl_str_mv PROTTI, 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)
http://hdl.handle.net/11422/2593
identifier_str_mv PROTTI, 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)
url http://hdl.handle.net/11422/2593
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv Relatório Técnico NCE
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.publisher.none.fl_str_mv Brasil
Instituto Tércio Pacitti de Aplicações e Pesquisas Computacionais
publisher.none.fl_str_mv Brasil
Instituto Tércio Pacitti de Aplicações e Pesquisas Computacionais
dc.source.none.fl_str_mv reponame:Repositório Institucional da UFRJ
instname:Universidade Federal do Rio de Janeiro (UFRJ)
instacron:UFRJ
instname_str Universidade Federal do Rio de Janeiro (UFRJ)
instacron_str UFRJ
institution UFRJ
reponame_str Repositório Institucional da UFRJ
collection Repositório Institucional da UFRJ
repository.name.fl_str_mv Repositório Institucional da UFRJ - Universidade Federal do Rio de Janeiro (UFRJ)
repository.mail.fl_str_mv pantheon@sibi.ufrj.br
_version_ 1815455965262118912

Registros relacionados