Publikation: Orthogonal-Ordering Constraints are Tough
Lade...
Dateien
Datum
2013
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 Gold
Core Facility der Universität Konstanz
Titel in einer weiteren Sprache
Publikationstyp
Zeitschriftenartikel
Publikationsstatus
Published
Erschienen in
Journal of Graph Algorithms and Applications. 2013, 17(1), pp. 1-10. ISSN 1526-1719. Available under: doi: 10.7155/jgaa.00281
Zusammenfassung
We show that rectilinear graph drawing, the core problem of bend-minimum orthogonal graph drawing, and uniform edge-length drawing, the core problem of force-directed placement, are NP-hard even for embedded paths if subjected to orthogonal-ordering constraints.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
004 Informatik
Schlagwörter
Konferenz
Rezension
undefined / . - undefined, undefined
Zitieren
ISO 690
BRANDES, Ulrik, Barbara PAMPEL, 2013. Orthogonal-Ordering Constraints are Tough. In: Journal of Graph Algorithms and Applications. 2013, 17(1), pp. 1-10. ISSN 1526-1719. Available under: doi: 10.7155/jgaa.00281BibTex
@article{Brandes2013Ortho-24169,
year={2013},
doi={10.7155/jgaa.00281},
title={Orthogonal-Ordering Constraints are Tough},
number={1},
volume={17},
issn={1526-1719},
journal={Journal of Graph Algorithms and Applications},
pages={1--10},
author={Brandes, Ulrik and Pampel, Barbara}
}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/24169">
<dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-08-22T11:08:59Z</dc:date>
<dc:creator>Brandes, Ulrik</dc:creator>
<void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
<bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/24169"/>
<dcterms:issued>2013</dcterms:issued>
<dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
<foaf:homepage rdf:resource="http://localhost:8080/"/>
<dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-08-22T11:08:59Z</dcterms:available>
<dcterms:title>Orthogonal-Ordering Constraints are Tough</dcterms:title>
<dc:rights>terms-of-use</dc:rights>
<dc:language>eng</dc:language>
<dc:contributor>Pampel, Barbara</dc:contributor>
<dc:contributor>Brandes, Ulrik</dc:contributor>
<dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/24169/2/Orthogonal-Ordering%20Constraints%20are%20Tough%202013.pdf"/>
<dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
<dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
<dcterms:bibliographicCitation>Journal of Graph Algorithms and Applications ; 17 (2013), 1. - S. 1-10</dcterms:bibliographicCitation>
<dc:creator>Pampel, Barbara</dc:creator>
<dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/24169/2/Orthogonal-Ordering%20Constraints%20are%20Tough%202013.pdf"/>
<dcterms:abstract xml:lang="eng">We show that rectilinear graph drawing, the core problem of bend-minimum orthogonal graph drawing, and uniform edge-length drawing, the core problem of force-directed placement, are NP-hard even for embedded paths if subjected to orthogonal-ordering constraints.</dcterms:abstract>
</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
