On the hardness of orthogonal-order preserving graph drawing

Brandes, Ulrik; Pampel, Barbara

On the hardness of orthogonal-order preserving graph drawing

Dateien

Brandes_opus-104772.pdfGröße: 208.15 KBDownloads: 164

Datum

2009

Open Access-Veröffentlichung

Open Access Green

Sammlungen

Informatik und Informationswissenschaft

Publikationstyp

Beitrag zu einem Konferenzband

Publikationsstatus

Published

Erschienen in

TOLLIS, Ioannis G., ed., Maurizio PATRIGNANI, ed.. Graph Drawing. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009, pp. 266-277. Lecture Notes in Computer Science. 5417. ISBN 978-3-642-00218-2. Available under: doi: 10.1007/978-3-642-00219-9_25

Fachgebiet (DDC)

004 Informatik

Schlagwörter

algo

Zitieren

ISO 690

BRANDES, Ulrik, Barbara PAMPEL, 2009. On the hardness of orthogonal-order preserving graph drawing. In: TOLLIS, Ioannis G., ed., Maurizio PATRIGNANI, ed.. Graph Drawing. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009, pp. 266-277. Lecture Notes in Computer Science. 5417. ISBN 978-3-642-00218-2. Available under: doi: 10.1007/978-3-642-00219-9_25

BibTex

@inproceedings{Brandes2009hardn-3002,
  year={2009},
  doi={10.1007/978-3-642-00219-9_25},
  title={On the hardness of orthogonal-order preserving graph drawing},
  number={5417},
  isbn={978-3-642-00218-2},
  publisher={Springer Berlin Heidelberg},
  address={Berlin, Heidelberg},
  series={Lecture Notes in Computer Science},
  booktitle={Graph Drawing},
  pages={266--277},
  editor={Tollis, Ioannis G. and Patrignani, Maurizio},
  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/3002">
    <dcterms:issued>2009</dcterms:issued>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/3002/1/Brandes_opus-104772.pdf"/>
    <dc:contributor>Brandes, Ulrik</dc:contributor>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/3002"/>
    <dc:creator>Brandes, Ulrik</dc:creator>
    <dc:creator>Pampel, Barbara</dc:creator>
    <dcterms:bibliographicCitation>Publ. in: Graph Drawing: 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008; revised papers / Ioannis G. Tollis ... (eds.). Berlin; Heidelberg: Springer, 2009, pp. 266-277 (= Lecture Notes in Computer Science ; vol. 5417)</dcterms:bibliographicCitation>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-23T10:15:43Z</dcterms:available>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/3002/1/Brandes_opus-104772.pdf"/>
    <dc:rights>terms-of-use</dc:rights>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-23T10:15:43Z</dc:date>
    <dc:language>eng</dc:language>
    <dcterms:title>On the hardness of orthogonal-order preserving graph drawing</dcterms:title>
    <dc:contributor>Pampel, Barbara</dc:contributor>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
  </rdf:Description>
</rdf:RDF>

Universitätsbibliographie

Ja