Publikation: More flexible radial layout
Lade...
Dateien
Datum
2011
Autor:innen
Pich, Christian
Herausgeber:innen
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
URI (zitierfähiger Link)
DOI (zitierfähiger Link)
Internationale Patentnummer
Link zur Lizenz
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Open Access Green
Core Facility der Universität Konstanz
Titel in einer weiteren Sprache
Publikationstyp
Zeitschriftenartikel
Publikationsstatus
Published
Erschienen in
Journal of Graph Algorithms and Applications. 2011, 15(1), pp. 157-173. ISSN 1526-1719. Available under: doi: 10.7155/jgaa.00221
Zusammenfassung
We describe an algorithm for radial layout of undirected graphs, in which nodes are constrained to concentric circles centered at the origin. Such constraints are typical, e.g., in the layout of social networks, when structural centrality is mapped to geometric centrality or when the pri- mary intention of the layout is the display of the vicinity of a distinguished node. Our approach is based on an extension of stress minimization with a weighting scheme that gradually imposes radial constraints on the inter-mediate layout during the majorization process, and thus is an attempt to preserve as much information about the graph structure as possible.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
004 Informatik
Schlagwörter
Konferenz
Rezension
undefined / . - undefined, undefined
Zitieren
ISO 690
BRANDES, Ulrik, Christian PICH, 2011. More flexible radial layout. In: Journal of Graph Algorithms and Applications. 2011, 15(1), pp. 157-173. ISSN 1526-1719. Available under: doi: 10.7155/jgaa.00221BibTex
@article{Brandes2011flexi-18002,
year={2011},
doi={10.7155/jgaa.00221},
title={More flexible radial layout},
number={1},
volume={15},
issn={1526-1719},
journal={Journal of Graph Algorithms and Applications},
pages={157--173},
author={Brandes, Ulrik and Pich, Christian}
}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/18002">
<dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2012-02-06T13:14:42Z</dc:date>
<dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/18002/2/More%20flexible%20radial%20layout.pdf"/>
<foaf:homepage rdf:resource="http://localhost:8080/"/>
<dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
<dc:rights>terms-of-use</dc:rights>
<void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
<dcterms:title>More flexible radial layout</dcterms:title>
<dcterms:issued>2011</dcterms:issued>
<dc:language>eng</dc:language>
<dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2012-02-06T13:14:42Z</dcterms:available>
<dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/18002/2/More%20flexible%20radial%20layout.pdf"/>
<dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
<dc:creator>Brandes, Ulrik</dc:creator>
<dcterms:bibliographicCitation>Publ. in: Journal of Graph Algorithms and Applications ; 15 (2011), 1. - S. 157-173</dcterms:bibliographicCitation>
<dc:creator>Pich, Christian</dc:creator>
<dc:contributor>Pich, Christian</dc:contributor>
<bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/18002"/>
<dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
<dcterms:abstract xml:lang="eng">We describe an algorithm for radial layout of undirected graphs, in which nodes are constrained to concentric circles centered at the origin. Such constraints are typical, e.g., in the layout of social networks, when structural centrality is mapped to geometric centrality or when the pri- mary intention of the layout is the display of the vicinity of a distinguished node. Our approach is based on an extension of stress minimization with a weighting scheme that gradually imposes radial constraints on the inter-mediate layout during the majorization process, and thus is an attempt to preserve as much information about the graph structure as possible.</dcterms:abstract>
<dc:contributor>Brandes, Ulrik</dc:contributor>
</rdf:Description>
</rdf:RDF>Interner Vermerk
xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter
Prüfungsdatum der Dissertation
Finanzierungsart
Kommentar zur Publikation
Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Ja
