A representation for the modules of a graph and applications

Detalhes bibliográficos
Autor(a) principal: Klein,Sulamita
Data de Publicação: 2003
Outros Autores: Szwarcfiter,Jaime L.
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Journal of the Brazilian Computer Society
Texto Completo: http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0104-65002003000200002
Resumo: We describe a simple representation for the modules of a graph G. We show that the modules of G are in one-to-one correspondence with the ideals of certain posets. These posets are characterized and shown to be layered posets, that is, transitive closures of bipartite tournaments. Additionaly, we describe applications of the representation. Employing the above correspondence, we present methods for solving the following problems: (i) generate all modules of G, (ii) count the number of modules of G, (iii) find a maximal module satisfying some hereditary property of G and (iv) find a connected non-trivial module of G.
id UFRGS-28_7727095dd0a036ab95c0a5bec74a74e6
oai_identifier_str oai:scielo:S0104-65002003000200002
network_acronym_str UFRGS-28
network_name_str Journal of the Brazilian Computer Society
repository_id_str
spelling A representation for the modules of a graph and applicationsgraphsidealsmodulesposetsbipartite tournamentsalgorithmsWe describe a simple representation for the modules of a graph G. We show that the modules of G are in one-to-one correspondence with the ideals of certain posets. These posets are characterized and shown to be layered posets, that is, transitive closures of bipartite tournaments. Additionaly, we describe applications of the representation. Employing the above correspondence, we present methods for solving the following problems: (i) generate all modules of G, (ii) count the number of modules of G, (iii) find a maximal module satisfying some hereditary property of G and (iv) find a connected non-trivial module of G.Sociedade Brasileira de Computação2003-11-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersiontext/htmlhttp://old.scielo.br/scielo.php?script=sci_arttext&pid=S0104-65002003000200002Journal of the Brazilian Computer Society v.9 n.1 2003reponame:Journal of the Brazilian Computer Societyinstname:Sociedade Brasileira de Computação (SBC)instacron:UFRGS10.1590/S0104-65002003000200002info:eu-repo/semantics/openAccessKlein,SulamitaSzwarcfiter,Jaime L.eng2004-09-14T00:00:00Zoai:scielo:S0104-65002003000200002Revistahttps://journal-bcs.springeropen.com/PUBhttps://old.scielo.br/oai/scielo-oai.phpjbcs@icmc.sc.usp.br1678-48040104-6500opendoar:2004-09-14T00:00Journal of the Brazilian Computer Society - Sociedade Brasileira de Computação (SBC)false
dc.title.none.fl_str_mv A representation for the modules of a graph and applications
title A representation for the modules of a graph and applications
spellingShingle A representation for the modules of a graph and applications
Klein,Sulamita
graphs
ideals
modules
posets
bipartite tournaments
algorithms
title_short A representation for the modules of a graph and applications
title_full A representation for the modules of a graph and applications
title_fullStr A representation for the modules of a graph and applications
title_full_unstemmed A representation for the modules of a graph and applications
title_sort A representation for the modules of a graph and applications
author Klein,Sulamita
author_facet Klein,Sulamita
Szwarcfiter,Jaime L.
author_role author
author2 Szwarcfiter,Jaime L.
author2_role author
dc.contributor.author.fl_str_mv Klein,Sulamita
Szwarcfiter,Jaime L.
dc.subject.por.fl_str_mv graphs
ideals
modules
posets
bipartite tournaments
algorithms
topic graphs
ideals
modules
posets
bipartite tournaments
algorithms
description We describe a simple representation for the modules of a graph G. We show that the modules of G are in one-to-one correspondence with the ideals of certain posets. These posets are characterized and shown to be layered posets, that is, transitive closures of bipartite tournaments. Additionaly, we describe applications of the representation. Employing the above correspondence, we present methods for solving the following problems: (i) generate all modules of G, (ii) count the number of modules of G, (iii) find a maximal module satisfying some hereditary property of G and (iv) find a connected non-trivial module of G.
publishDate 2003
dc.date.none.fl_str_mv 2003-11-01
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0104-65002003000200002
url http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0104-65002003000200002
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 10.1590/S0104-65002003000200002
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv text/html
dc.publisher.none.fl_str_mv Sociedade Brasileira de Computação
publisher.none.fl_str_mv Sociedade Brasileira de Computação
dc.source.none.fl_str_mv Journal of the Brazilian Computer Society v.9 n.1 2003
reponame:Journal of the Brazilian Computer Society
instname:Sociedade Brasileira de Computação (SBC)
instacron:UFRGS
instname_str Sociedade Brasileira de Computação (SBC)
instacron_str UFRGS
institution UFRGS
reponame_str Journal of the Brazilian Computer Society
collection Journal of the Brazilian Computer Society
repository.name.fl_str_mv Journal of the Brazilian Computer Society - Sociedade Brasileira de Computação (SBC)
repository.mail.fl_str_mv jbcs@icmc.sc.usp.br
_version_ 1754734669594624000

Registros relacionados