Path-based supports for hypergraphs


Dateien zu dieser Ressource

Prüfsumme: MD5:f4d5911c0a8eeff65932ab51d21985e4

BRANDES, Ulrik, Sabine CORNELSEN, Barbara PAMPEL, Arnaud SALLABERRY, 2011. Path-based supports for hypergraphs. IWOCA. London, UK, 26. Jul 2010 - 28. Jul 2010. In: ILIOPOULOS, Costas S., ed. and others. Combinatorial algorithms : 21st International Workshop. Berlin ; Heidelberg [u.a.]:Springer, pp. 20-33. ISBN 978-3-642-19221-0. Available under: doi: 10.1007/978-3-642-19222-7_3

@inproceedings{Brandes2011Pathb-17994, title={Path-based supports for hypergraphs}, year={2011}, doi={10.1007/978-3-642-19222-7_3}, number={6460}, isbn={978-3-642-19221-0}, address={Berlin ; Heidelberg [u.a.]}, publisher={Springer}, series={Lecture notes in computer science}, booktitle={Combinatorial algorithms : 21st International Workshop}, pages={20--33}, editor={Iliopoulos, Costas S.}, author={Brandes, Ulrik and Cornelsen, Sabine and Pampel, Barbara and Sallaberry, Arnaud} }

<rdf:RDF xmlns:dcterms="" xmlns:dc="" xmlns:rdf="" xmlns:bibo="" xmlns:dspace="" xmlns:foaf="" xmlns:void="" xmlns:xsd="" > <rdf:Description rdf:about=""> <dc:contributor>Cornelsen, Sabine</dc:contributor> <dc:creator>Pampel, Barbara</dc:creator> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dspace:hasBitstream rdf:resource=""/> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:creator>Cornelsen, Sabine</dc:creator> <dcterms:isPartOf rdf:resource=""/> <dcterms:issued>2011</dcterms:issued> <bibo:uri rdf:resource=""/> <dc:creator>Brandes, Ulrik</dc:creator> <dc:contributor>Pampel, Barbara</dc:contributor> <dc:creator>Sallaberry, Arnaud</dc:creator> <dcterms:rights rdf:resource=""/> <dcterms:abstract xml:lang="eng">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-complete to compute 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:language>eng</dc:language> <dc:contributor>Sallaberry, Arnaud</dc:contributor> <dspace:isPartOfCollection rdf:resource=""/> <dc:date rdf:datatype="">2012-02-07T07:45:12Z</dc:date> <dc:contributor>Brandes, Ulrik</dc:contributor> <dcterms:hasPart rdf:resource=""/> <dc:rights>terms-of-use</dc:rights> <dcterms:title>Path-based supports for hypergraphs</dcterms:title> <dcterms:available rdf:datatype="">2012-02-07T07:45:12Z</dcterms:available> <dcterms:bibliographicCitation>Publ. in: Combinatorial algorithms : 21st International Workshop, IWOCA 2010, London, UK, July 26 - 28, 2010; revised selected papers / Costas S. Iliopoulos ... (eds.). - Berlin ; Heidelberg [u.a.] : Springer, 2011. - S. 20-33. - (Lecture notes in computer science ; 6460). - ISBN 978-3-642-19221-0</dcterms:bibliographicCitation> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

Brandes_179948.pdf 17

Das Dokument erscheint in:

KOPS Suche


Mein Benutzerkonto