Directed hypergraph planarity

Detalhes bibliográficos
Autor(a) principal: Guedes,André Luiz Pires
Data de Publicação: 2005
Outros Autores: Markenzon,Lilian
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Pesquisa operacional (Online)
Texto Completo: http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382005000300005
Resumo: Directed hypergraphs are generalizations of digraphs and can be used to model binary relations among subsets of a given set. Planarity of hypergraphs was studied by Johnson and Pollak; in this paper we extend the planarity concept to directed hypergraphs. It is known that the planarity of a digraph relies on the planarity of its underlying graph. However, for directed hypergraphs, this property do not apply and we propose a new approach which generalizes the usual concept. We also show that the complexity of the recognition of a directed hypergraph as planar is linear on the size of the hypergraph.
id SOBRAPO-1_2c7f0833cca95add43eac52d6105ded5
oai_identifier_str oai:scielo:S0101-74382005000300005
network_acronym_str SOBRAPO-1
network_name_str Pesquisa operacional (Online)
repository_id_str
spelling Directed hypergraph planaritydirected hypergraphsplanarityalgorithmsDirected hypergraphs are generalizations of digraphs and can be used to model binary relations among subsets of a given set. Planarity of hypergraphs was studied by Johnson and Pollak; in this paper we extend the planarity concept to directed hypergraphs. It is known that the planarity of a digraph relies on the planarity of its underlying graph. However, for directed hypergraphs, this property do not apply and we propose a new approach which generalizes the usual concept. We also show that the complexity of the recognition of a directed hypergraph as planar is linear on the size of the hypergraph.Sociedade Brasileira de Pesquisa Operacional2005-12-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersiontext/htmlhttp://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382005000300005Pesquisa Operacional v.25 n.3 2005reponame:Pesquisa operacional (Online)instname:Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)instacron:SOBRAPO10.1590/S0101-74382005000300005info:eu-repo/semantics/openAccessGuedes,André Luiz PiresMarkenzon,Lilianeng2006-02-20T00:00:00Zoai:scielo:S0101-74382005000300005Revistahttp://www.scielo.br/popehttps://old.scielo.br/oai/scielo-oai.php||sobrapo@sobrapo.org.br1678-51420101-7438opendoar:2006-02-20T00:00Pesquisa operacional (Online) - Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)false
dc.title.none.fl_str_mv Directed hypergraph planarity
title Directed hypergraph planarity
spellingShingle Directed hypergraph planarity
Guedes,André Luiz Pires
directed hypergraphs
planarity
algorithms
title_short Directed hypergraph planarity
title_full Directed hypergraph planarity
title_fullStr Directed hypergraph planarity
title_full_unstemmed Directed hypergraph planarity
title_sort Directed hypergraph planarity
author Guedes,André Luiz Pires
author_facet Guedes,André Luiz Pires
Markenzon,Lilian
author_role author
author2 Markenzon,Lilian
author2_role author
dc.contributor.author.fl_str_mv Guedes,André Luiz Pires
Markenzon,Lilian
dc.subject.por.fl_str_mv directed hypergraphs
planarity
algorithms
topic directed hypergraphs
planarity
algorithms
description Directed hypergraphs are generalizations of digraphs and can be used to model binary relations among subsets of a given set. Planarity of hypergraphs was studied by Johnson and Pollak; in this paper we extend the planarity concept to directed hypergraphs. It is known that the planarity of a digraph relies on the planarity of its underlying graph. However, for directed hypergraphs, this property do not apply and we propose a new approach which generalizes the usual concept. We also show that the complexity of the recognition of a directed hypergraph as planar is linear on the size of the hypergraph.
publishDate 2005
dc.date.none.fl_str_mv 2005-12-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=S0101-74382005000300005
url http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382005000300005
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 10.1590/S0101-74382005000300005
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 Pesquisa Operacional
publisher.none.fl_str_mv Sociedade Brasileira de Pesquisa Operacional
dc.source.none.fl_str_mv Pesquisa Operacional v.25 n.3 2005
reponame:Pesquisa operacional (Online)
instname:Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)
instacron:SOBRAPO
instname_str Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)
instacron_str SOBRAPO
institution SOBRAPO
reponame_str Pesquisa operacional (Online)
collection Pesquisa operacional (Online)
repository.name.fl_str_mv Pesquisa operacional (Online) - Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)
repository.mail.fl_str_mv ||sobrapo@sobrapo.org.br
_version_ 1750318016581599232

Registros relacionados