Drawing Graphs on Two and Three Lines

Cite This

Files in this item

Files Size Format View

There are no files associated with this item.

CORNELSEN, Sabine, Thomas SCHANK, Dorothea WAGNER, 2002. Drawing Graphs on Two and Three Lines. In: GOOS, Gerhard, ed., Juris HARTMANIS, ed., Jan VAN LEEUWEN, ed.. Graph Drawing. Berlin:Springer, pp. 31-41. ISSN 0302-9743. eISSN 1611-3349. ISBN 978-3-540-00158-4. Available under: doi: 10.1007/3-540-36151-0_4

@inproceedings{Cornelsen2002-11-08Drawi-44803, title={Drawing Graphs on Two and Three Lines}, year={2002}, doi={10.1007/3-540-36151-0_4}, number={2528}, isbn={978-3-540-00158-4}, issn={0302-9743}, address={Berlin}, publisher={Springer}, series={Lecture Notes in Computer Science}, booktitle={Graph Drawing}, pages={31--41}, editor={Goos, Gerhard and Hartmanis, Juris and van Leeuwen, Jan}, author={Cornelsen, Sabine and Schank, Thomas and Wagner, Dorothea} }

<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/44803"> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:language>eng</dc:language> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2019-02-01T13:12:51Z</dc:date> <dc:contributor>Schank, Thomas</dc:contributor> <dc:creator>Wagner, Dorothea</dc:creator> <dcterms:issued>2002-11-08</dcterms:issued> <dc:contributor>Cornelsen, Sabine</dc:contributor> <dc:creator>Schank, Thomas</dc:creator> <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/44803"/> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dcterms:title>Drawing Graphs on Two and Three Lines</dcterms:title> <dcterms:abstract xml:lang="eng">We give a linear-time algorithm to decide whether a graph has a planar LL-drawing, i.e. a planar drawing on two parallel lines. This has previously been known only for trees. We utilize this result to obtain planar drawings on three lines for a generalization of bipartite graphs, also in linear time.</dcterms:abstract> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2019-02-01T13:12:51Z</dcterms:available> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dc:contributor>Wagner, Dorothea</dc:contributor> <dc:creator>Cornelsen, Sabine</dc:creator> </rdf:Description> </rdf:RDF>

This item appears in the following Collection(s)

Search KOPS


Browse

My Account