Orthogonal-Ordering Constraints are Tough

Zitieren

Dateien zu dieser Ressource

Prüfsumme: MD5:1c7f33c66f2bf8a3272681cda029a3c2

BRANDES, Ulrik, Barbara PAMPEL, 2013. Orthogonal-Ordering Constraints are Tough. In: Journal of Graph Algorithms and Applications. 17(1), pp. 1-10. ISSN 1526-1719. Available under: doi: 10.7155/jgaa.00281

@article{Brandes2013Ortho-24169, title={Orthogonal-Ordering Constraints are Tough}, year={2013}, doi={10.7155/jgaa.00281}, 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 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/rdf/resource/123456789/24169"> <dcterms:rights rdf:resource="http://nbn-resolving.org/urn:nbn:de:bsz:352-20140905103605204-4002607-1"/> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/24169/2/Orthogonal-Ordering%20Constraints%20are%20Tough%202013.pdf"/> <dc:contributor>Brandes, Ulrik</dc:contributor> <dc:creator>Brandes, Ulrik</dc:creator> <dcterms:title>Orthogonal-Ordering Constraints are Tough</dcterms:title> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dcterms:bibliographicCitation>Journal of Graph Algorithms and Applications ; 17 (2013), 1. - S. 1-10</dcterms:bibliographicCitation> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/24169"/> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-08-22T11:08:59Z</dc:date> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:creator>Pampel, Barbara</dc:creator> <dc:contributor>Pampel, Barbara</dc:contributor> <dc:rights>deposit-license</dc:rights> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-08-22T11:08:59Z</dcterms:available> <dc:language>eng</dc:language> <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> <dcterms:issued>2013</dcterms:issued> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/24169/2/Orthogonal-Ordering%20Constraints%20are%20Tough%202013.pdf"/> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

Orthogonal-Ordering Constraints are Tough 2013.pdf 128

Das Dokument erscheint in:

KOPS Suche


Stöbern

Mein Benutzerkonto