Drawing the As Graph in 2.5 Dimensions

dc.contributor.authorBaur, Michaeldeu
dc.contributor.authorBrandes, Ulrik
dc.contributor.authorGaertler, Marcodeu
dc.contributor.authorWagner, Dorotheadeu
dc.date.accessioned2011-03-24T15:59:24Zdeu
dc.date.available2011-03-24T15:59:24Zdeu
dc.date.issued2005
dc.description.abstractWe 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.eng
dc.description.versionpublished
dc.format.mimetypeapplication/pdfdeu
dc.identifier.citationFirst publ. in: Proceedings of the 12th International Symposium Graph Drawing (GD ´04) (LNCS 3383), 2004, pp. 43-48deu
dc.identifier.doi10.1007/978-3-540-31843-9_6
dc.identifier.ppn304538825deu
dc.identifier.urihttp://kops.uni-konstanz.de/handle/123456789/5692
dc.language.isoengdeu
dc.legacy.dateIssued2009deu
dc.rightsAttribution-NonCommercial-NoDerivs 2.0 Generic
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/2.0/
dc.subject.ddc004deu
dc.titleDrawing the As Graph in 2.5 Dimensionseng
dc.typeINPROCEEDINGSdeu
dspace.entity.typePublication
kops.citation.bibtex
@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}
}
kops.citation.iso690BAUR, 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, 2005, pp. 43-48. Lecture Notes in Computer Science. 3383. ISBN 978-3-540-24528-5. Available under: doi: 10.1007/978-3-540-31843-9_6deu
kops.citation.iso690BAUR, 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, 2005, pp. 43-48. Lecture Notes in Computer Science. 3383. ISBN 978-3-540-24528-5. Available under: doi: 10.1007/978-3-540-31843-9_6eng
kops.citation.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>
kops.description.openAccessopenaccessgreen
kops.flag.knbibliographytrue
kops.identifier.nbnurn:nbn:de:bsz:352-opus-77170deu
kops.opus.id7717deu
kops.sourcefieldPACH, János, ed.. <i>Graph Drawing</i>. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005, pp. 43-48. Lecture Notes in Computer Science. 3383. ISBN 978-3-540-24528-5. Available under: doi: 10.1007/978-3-540-31843-9_6deu
kops.sourcefield.plainPACH, János, ed.. Graph Drawing. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005, pp. 43-48. Lecture Notes in Computer Science. 3383. ISBN 978-3-540-24528-5. Available under: doi: 10.1007/978-3-540-31843-9_6deu
kops.sourcefield.plainPACH, János, ed.. Graph Drawing. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005, pp. 43-48. Lecture Notes in Computer Science. 3383. ISBN 978-3-540-24528-5. Available under: doi: 10.1007/978-3-540-31843-9_6eng
relation.isAuthorOfPublicationfa1660c9-a071-4d01-9bdd-7adcd0e2d7d7
relation.isAuthorOfPublication.latestForDiscoveryfa1660c9-a071-4d01-9bdd-7adcd0e2d7d7
source.bibliographicInfo.fromPage43
source.bibliographicInfo.seriesNumber3383
source.bibliographicInfo.toPage48
source.contributor.editorPach, János
source.identifier.isbn978-3-540-24528-5
source.publisherSpringer Berlin Heidelberg
source.publisher.locationBerlin, Heidelberg
source.relation.ispartofseriesLecture Notes in Computer Science
source.titleGraph Drawing

Dateien

Originalbündel

Gerade angezeigt 1 - 1 von 1
Vorschaubild nicht verfügbar
Name:
bbgw_dasgt_04.pdf
Größe:
192.07 KB
Format:
Adobe Portable Document Format
bbgw_dasgt_04.pdf
bbgw_dasgt_04.pdfGröße: 192.07 KBDownloads: 346