Drawing the As Graph in 2.5 Dimensions
Drawing the As Graph in 2.5 Dimensions
Loading...
Date
2005
Authors
Editors
Journal ISSN
Electronic ISSN
ISBN
Bibliographical data
Publisher
Series
URI (citable link)
DOI (citable link)
International patent number
Link to the license
EU project number
Project
Open Access publication
Collections
Title in another language
Publication type
Contribution to a conference collection
Publication status
Published in
Graph Drawing / Pach, János (ed.). - Berlin, Heidelberg : Springer Berlin Heidelberg, 2005. - (Lecture Notes in Computer Science ; 3383). - pp. 43-48. - ISBN 978-3-540-24528-5
Abstract
We propose a method for drawing AS graph data using 2.5D graph visualization. In order to bring out the pure graph structure of the AS graph we consider its core hierarchy. The k-cores are represented by 2D layouts whose interdependence for increasing k is displayed by the third dimension. For the core with maximum value a spectral layout is chosen thus emphasizing on the most important part of the AS graph. The lower cores are added iteratively by force-based methods. In contrast to alternative approaches to visualize AS graph data, our method illustrates the entire AS graph structure. Moreover, it is generic with regard to the hierarchy displayed by the third dimension.
Summary in another language
Subject (DDC)
004 Computer Science
Keywords
Conference
Review
undefined / . - undefined, undefined. - (undefined; undefined)
Cite This
ISO 690
BAUR, Michael, Ulrik BRANDES, Marco GAERTLER, Dorothea WAGNER, 2005. Drawing the As Graph in 2.5 Dimensions. In: PACH, János, ed.. Graph Drawing. Berlin, Heidelberg:Springer Berlin Heidelberg, pp. 43-48. ISBN 978-3-540-24528-5. Available under: doi: 10.1007/978-3-540-31843-9_6BibTex
@inproceedings{Baur2005Drawi-5692, year={2005}, doi={10.1007/978-3-540-31843-9_6}, title={Drawing the As Graph in 2.5 Dimensions}, number={3383}, isbn={978-3-540-24528-5}, publisher={Springer Berlin Heidelberg}, address={Berlin, Heidelberg}, series={Lecture Notes in Computer Science}, booktitle={Graph Drawing}, pages={43--48}, editor={Pach, János}, author={Baur, Michael and Brandes, Ulrik and Gaertler, Marco and Wagner, Dorothea} }
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/5692"> <dcterms:bibliographicCitation>First publ. in: Proceedings of the 12th International Symposium Graph Drawing (GD ´04) (LNCS 3383), 2004, pp. 43-48</dcterms:bibliographicCitation> <foaf:homepage rdf:resource="http://localhost:8080/"/> <dc:rights>Attribution-NonCommercial-NoDerivs 2.0 Generic</dc:rights> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <dc:creator>Brandes, Ulrik</dc:creator> <dc:creator>Baur, Michael</dc:creator> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dcterms:title>Drawing the As Graph in 2.5 Dimensions</dcterms:title> <dc:contributor>Wagner, Dorothea</dc:contributor> <dcterms:issued>2005</dcterms:issued> <dc:format>application/pdf</dc:format> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5692"/> <dc:contributor>Gaertler, Marco</dc:contributor> <dcterms:rights rdf:resource="http://creativecommons.org/licenses/by-nc-nd/2.0/"/> <dcterms:abstract xml:lang="eng">We propose a method for drawing AS graph data using 2.5D graph visualization. In order to bring out the pure graph structure of the AS graph we consider its core hierarchy. The k-cores are represented by 2D layouts whose interdependence for increasing k is displayed by the third dimension. For the core with maximum value a spectral layout is chosen thus emphasizing on the most important part of the AS graph. The lower cores are added iteratively by force-based methods. In contrast to alternative approaches to visualize AS graph data, our method illustrates the entire AS graph structure. Moreover, it is generic with regard to the hierarchy displayed by the third dimension.</dcterms:abstract> <dc:contributor>Brandes, Ulrik</dc:contributor> <dc:creator>Wagner, Dorothea</dc:creator> <dc:language>eng</dc:language> <dc:creator>Gaertler, Marco</dc:creator> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:59:24Z</dc:date> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5692/1/bbgw_dasgt_04.pdf"/> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5692/1/bbgw_dasgt_04.pdf"/> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:59:24Z</dcterms:available> <dc:contributor>Baur, Michael</dc:contributor> </rdf:Description> </rdf:RDF>
Internal note
xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter
Examination date of dissertation
Method of financing
Comment on publication
Alliance license
Corresponding Authors der Uni Konstanz vorhanden
International Co-Authors
Bibliography of Konstanz
Yes