Path-based supports for hypergraphs

Kurzanzeige
dc.contributor.authorBrandes, Ulrik
dc.contributor.authorCornelsen, Sabine
dc.contributor.authorPampel, Barbara
dc.contributor.authorSallaberry, Arnauddeu
dc.date.accessioned2012-11-23T08:56:13Zdeu
dc.date.available2012-11-23T08:56:13Zdeu
dc.date.issued2012
dc.description.abstractA path-based support of a hypergraph H is a graph with the same vertex set as H in which each hyperedge induces a Hamiltonian subgraph. While it is NP-hard to decide whether a path-based support has a monotone drawing, to determine a path-based support with the minimum number of edges, or to decide whether there is a planar path-based support, we show that a path-based tree support can be computed in polynomial time if it exists.
dc.description.versionpublished
dc.identifier.citationJournal of Discrete Algorithms ; 14 (2012). - S. 248-261deu
dc.identifier.doi10.1016/j.jda.2011.12.009deu
dc.identifier.ppn487676106
dc.identifier.urihttp://kops.uni-konstanz.de/handle/123456789/20925
dc.language.isoengdeu
dc.legacy.dateIssued2012-11-23deu
dc.rightsterms-of-usedeu
dc.rights.urihttps://rightsstatements.org/page/InC/1.0/deu
dc.subject.ddc004deu
dc.titlePath-based supports for hypergraphseng
dc.typeJOURNAL_ARTICLEdeu
dspace.entity.typePublication
kops.citation.bibtex
@article{Brandes2012Pathb-20925,
  year={2012},
  doi={10.1016/j.jda.2011.12.009},
  title={Path-based supports for hypergraphs},
  volume={14},
  issn={1570-8667},
  journal={Journal of Discrete Algorithms},
  pages={248--261},
  author={Brandes, Ulrik and Cornelsen, Sabine and Pampel, Barbara and Sallaberry, Arnaud}
}
kops.citation.iso690BRANDES, Ulrik, Sabine CORNELSEN, Barbara PAMPEL, Arnaud SALLABERRY, 2012. Path-based supports for hypergraphs. In: Journal of Discrete Algorithms. 2012, 14, pp. 248-261. ISSN 1570-8667. eISSN 1570-8667. Available under: doi: 10.1016/j.jda.2011.12.009deu
kops.citation.iso690BRANDES, Ulrik, Sabine CORNELSEN, Barbara PAMPEL, Arnaud SALLABERRY, 2012. Path-based supports for hypergraphs. In: Journal of Discrete Algorithms. 2012, 14, pp. 248-261. ISSN 1570-8667. eISSN 1570-8667. Available under: doi: 10.1016/j.jda.2011.12.009eng
kops.citation.rdf
<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/20925">
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:creator>Sallaberry, Arnaud</dc:creator>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/20925/2/Brandes_209250.pdf"/>
    <dcterms:bibliographicCitation>Journal of Discrete Algorithms ; 14 (2012). - S. 248-261</dcterms:bibliographicCitation>
    <dcterms:issued>2012</dcterms:issued>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/20925/2/Brandes_209250.pdf"/>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2012-11-23T08:56:13Z</dc:date>
    <dcterms:abstract>A path-based support of a hypergraph H is a graph with the same vertex set as H in which each hyperedge induces a Hamiltonian subgraph. While it is NP-hard to decide whether a path-based support has a monotone drawing, to determine a path-based support with the minimum number of edges, or to decide whether there is a planar path-based support, we show that a path-based tree support can be computed in polynomial time if it exists.</dcterms:abstract>
    <dc:contributor>Brandes, Ulrik</dc:contributor>
    <dc:contributor>Sallaberry, Arnaud</dc:contributor>
    <dc:contributor>Pampel, Barbara</dc:contributor>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dcterms:title>Path-based supports for hypergraphs</dcterms:title>
    <dc:creator>Cornelsen, Sabine</dc:creator>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/20925"/>
    <dc:creator>Pampel, Barbara</dc:creator>
    <dc:contributor>Cornelsen, Sabine</dc:contributor>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:rights>terms-of-use</dc:rights>
    <dc:creator>Brandes, Ulrik</dc:creator>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2012-11-23T08:56:13Z</dcterms:available>
    <dc:language>eng</dc:language>
  </rdf:Description>
</rdf:RDF>
kops.description.openAccessopenaccessgreen
kops.flag.knbibliographytrue
kops.identifier.nbnurn:nbn:de:bsz:352-209250deu
kops.sourcefieldJournal of Discrete Algorithms. 2012, <b>14</b>, pp. 248-261. ISSN 1570-8667. eISSN 1570-8667. Available under: doi: 10.1016/j.jda.2011.12.009deu
kops.sourcefield.plainJournal of Discrete Algorithms. 2012, 14, pp. 248-261. ISSN 1570-8667. eISSN 1570-8667. Available under: doi: 10.1016/j.jda.2011.12.009deu
kops.sourcefield.plainJournal of Discrete Algorithms. 2012, 14, pp. 248-261. ISSN 1570-8667. eISSN 1570-8667. Available under: doi: 10.1016/j.jda.2011.12.009eng
kops.submitter.emaillaura.liebermann@uni-konstanz.dedeu
relation.isAuthorOfPublicationfa1660c9-a071-4d01-9bdd-7adcd0e2d7d7
relation.isAuthorOfPublicationab8dd64c-60a5-4662-9603-d40fd0e6c6f3
relation.isAuthorOfPublication6212eac6-d61d-4673-8f7d-ebfe58a6f8ea
relation.isAuthorOfPublication.latestForDiscoveryfa1660c9-a071-4d01-9bdd-7adcd0e2d7d7
source.bibliographicInfo.fromPage248
source.bibliographicInfo.toPage261
source.bibliographicInfo.volume14
source.identifier.eissn1570-8667deu
source.identifier.issn1570-8667
source.periodicalTitleJournal of Discrete Algorithms

Dateien

Originalbündel

Gerade angezeigt 1 - 1 von 1
Vorschaubild nicht verfügbar
Name:
Brandes_209250.pdf
Größe:
713.62 KB
Format:
Adobe Portable Document Format
Beschreibung:
Brandes_209250.pdf
Brandes_209250.pdfGröße: 713.62 KBDownloads: 235

Lizenzbündel

Gerade angezeigt 1 - 1 von 1
Vorschaubild nicht verfügbar
Name:
license.txt
Größe:
1.92 KB
Format:
Plain Text
Beschreibung:
license.txt
license.txtGröße: 1.92 KBDownloads: 0

Sammlungen

Informatik und Informationswissenschaft: Publikationen