Path-based supports for hypergraphs
Lade...
Dateien
Datum
2011
Autor:innen
Herausgeber:innen
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
URI (zitierfähiger Link)
DOI (zitierfähiger Link)
Internationale Patentnummer
Link zur Lizenz
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Open Access Green
Sammlungen
Core Facility der Universität Konstanz
Titel in einer weiteren Sprache
Publikationstyp
Beitrag zu einem Konferenzband
Publikationsstatus
Published
Erschienen in
ILIOPOULOS, Costas S., ed. and others. Combinatorial algorithms : 21st International Workshop. Berlin ; Heidelberg [u.a.]: Springer, 2011, pp. 20-33. Lecture notes in computer science. 6460. ISBN 978-3-642-19221-0. Available under: doi: 10.1007/978-3-642-19222-7_3
Zusammenfassung
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.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
004 Informatik
Schlagwörter
Konferenz
IWOCA, 26. Juli 2010 - 28. Juli 2010, London, UK
Rezension
undefined / . - undefined, undefined
Zitieren
ISO 690
BRANDES, Ulrik, Sabine CORNELSEN, Barbara PAMPEL, Arnaud SALLABERRY, 2011. Path-based supports for hypergraphs. IWOCA. London, UK, 26. Juli 2010 - 28. Juli 2010. In: ILIOPOULOS, Costas S., ed. and others. Combinatorial algorithms : 21st International Workshop. Berlin ; Heidelberg [u.a.]: Springer, 2011, pp. 20-33. Lecture notes in computer science. 6460. ISBN 978-3-642-19221-0. Available under: doi: 10.1007/978-3-642-19222-7_3BibTex
@inproceedings{Brandes2011Pathb-17994, year={2011}, doi={10.1007/978-3-642-19222-7_3}, title={Path-based supports for hypergraphs}, number={6460}, isbn={978-3-642-19221-0}, publisher={Springer}, address={Berlin ; Heidelberg [u.a.]}, 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: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/17994"> <dcterms:issued>2011</dcterms:issued> <dc:contributor>Sallaberry, Arnaud</dc:contributor> <dc:language>eng</dc:language> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:creator>Sallaberry, Arnaud</dc:creator> <dc:contributor>Cornelsen, Sabine</dc:contributor> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2012-02-07T07:45:12Z</dcterms:available> <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2012-02-07T07:45:12Z</dc:date> <dc:creator>Pampel, Barbara</dc:creator> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/17994"/> <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> <dcterms:title>Path-based supports for hypergraphs</dcterms:title> <dc:contributor>Brandes, Ulrik</dc:contributor> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/17994/2/Brandes_179948.pdf"/> <dc:contributor>Pampel, Barbara</dc:contributor> <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> <dc:rights>terms-of-use</dc:rights> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/17994/2/Brandes_179948.pdf"/> <dc:creator>Cornelsen, Sabine</dc:creator> <dc:creator>Brandes, Ulrik</dc:creator> <foaf:homepage rdf:resource="http://localhost:8080/"/> </rdf:Description> </rdf:RDF>
Interner Vermerk
xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter
Prüfungsdatum der Dissertation
Finanzierungsart
Kommentar zur Publikation
Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Ja