Graph drawing by classical multidimensional scaling : new perspectives

Klimenta, Mirza; Brandes, Ulrik

Graph drawing by classical multidimensional scaling : new perspectives

Dateien

Klimenta_243981.pdfGröße: 1.84 MBDownloads: 480

Datum

2013

Open Access-Veröffentlichung

Open Access Green

Sammlungen

Informatik und Informationswissenschaft

Publikationstyp

Beitrag zu einem Konferenzband

Publikationsstatus

Published

Erschienen in

DIDIMO, Walter, ed., Maurizio PATRIGNANI, ed.. Graph Drawing. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013, pp. 55-66. Lecture Notes in Computer Science. 7704. ISBN 978-3-642-36762-5. Available under: doi: 10.1007/978-3-642-36763-2_6

Zusammenfassung

With shortest-path distances as input, classical multidimensional scaling can be regarded as a spectral graph drawing algorithm, and recent approximation techniques make it scale to very large graphs. In comparison with other methods, however, it is considered inflexible and prone to degenerate layouts for some classes of graphs.

We want to challenge this belief by demonstrating that the method can be flexibly adapted to provide focus+context layouts. Moreover, we propose an alternative instantiation that appears to be more suitable for graph drawing and prevents certain degeneracies.

Fachgebiet (DDC)

004 Informatik

Zitieren

ISO 690

KLIMENTA, Mirza, Ulrik BRANDES, 2013. Graph drawing by classical multidimensional scaling : new perspectives. In: DIDIMO, Walter, ed., Maurizio PATRIGNANI, ed.. Graph Drawing. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013, pp. 55-66. Lecture Notes in Computer Science. 7704. ISBN 978-3-642-36762-5. Available under: doi: 10.1007/978-3-642-36763-2_6

BibTex

@inproceedings{Klimenta2013Graph-24398,
  year={2013},
  doi={10.1007/978-3-642-36763-2_6},
  title={Graph drawing by classical multidimensional scaling : new perspectives},
  number={7704},
  isbn={978-3-642-36762-5},
  publisher={Springer Berlin Heidelberg},
  address={Berlin, Heidelberg},
  series={Lecture Notes in Computer Science},
  booktitle={Graph Drawing},
  pages={55--66},
  editor={Didimo, Walter and Patrignani, Maurizio},
  author={Klimenta, Mirza and Brandes, Ulrik}
}

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/24398">
    <dc:language>eng</dc:language>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/24398/1/Klimenta_243981.pdf"/>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/24398/1/Klimenta_243981.pdf"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-09-16T13:34:46Z</dc:date>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:title>Graph drawing by classical multidimensional scaling : new perspectives</dcterms:title>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2014-07-31T22:25:05Z</dcterms:available>
    <dc:rights>terms-of-use</dc:rights>
    <dcterms:bibliographicCitation>Graph drawing : 20th international symposium; revised selected papers; GD 2012, Redmond, WA, USA, September 19 - 21, 2012 / Walter Didimo ... (eds.) - Berlin [u.a.] : Springer, 2013. - S. 55-66. - (Lecture notes in computer science ; 7704). - ISBN 978-3-642-36762-5</dcterms:bibliographicCitation>
    <dc:contributor>Klimenta, Mirza</dc:contributor>
    <dc:creator>Klimenta, Mirza</dc:creator>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/24398"/>
    <dcterms:abstract xml:lang="eng">With shortest-path distances as input, classical multidimensional scaling can be regarded as a spectral graph drawing algorithm, and recent approximation techniques make it scale to very large graphs. In comparison with other methods, however, it is considered inflexible and prone to degenerate layouts for some classes of graphs.&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;We want to challenge this belief by demonstrating that the method can be flexibly adapted to provide focus+context layouts. Moreover, we propose an alternative instantiation that appears to be more suitable for graph drawing and prevents certain degeneracies.</dcterms:abstract>
    <dc:contributor>Brandes, Ulrik</dc:contributor>
    <dcterms:issued>2013</dcterms:issued>
    <dc:creator>Brandes, Ulrik</dc:creator>
  </rdf:Description>
</rdf:RDF>

Universitätsbibliographie

Ja