More flexible radial layout

Cite This

Files in this item

Checksum: MD5:fa7c0e9c7a3e7058a98208b19e5897c2

BRANDES, Ulrik, Christian PICH, 2011. More flexible radial layout. In: Journal of Graph Algorithms and Applications. 15(1), pp. 157-173. ISSN 1526-1719. Available under: doi: 10.7155/jgaa.00221

@article{Brandes2011flexi-18002, title={More flexible radial layout}, year={2011}, doi={10.7155/jgaa.00221}, 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 xmlns:dcterms="" xmlns:dc="" xmlns:rdf="" xmlns:bibo="" xmlns:dspace="" xmlns:foaf="" xmlns:void="" xmlns:xsd="" > <rdf:Description rdf:about=""> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:contributor>Pich, Christian</dc:contributor> <dcterms:bibliographicCitation>Publ. in: Journal of Graph Algorithms and Applications ; 15 (2011), 1. - S. 157-173</dcterms:bibliographicCitation> <bibo:uri rdf:resource=""/> <dcterms:rights rdf:resource=""/> <dcterms:issued>2011</dcterms:issued> <dcterms:isPartOf rdf:resource=""/> <dc:creator>Brandes, Ulrik</dc:creator> <dc:date rdf:datatype="">2012-02-06T13:14:42Z</dc:date> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dcterms:available rdf:datatype="">2012-02-06T13:14:42Z</dcterms:available> <dc:rights>terms-of-use</dc:rights> <dspace:isPartOfCollection rdf:resource=""/> <dcterms:hasPart rdf:resource=""/> <dcterms:title>More flexible radial layout</dcterms:title> <dc:contributor>Brandes, Ulrik</dc:contributor> <dc:creator>Pich, Christian</dc:creator> <dspace:hasBitstream rdf:resource=""/> <dc:language>eng</dc:language> <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> </rdf:Description> </rdf:RDF>

Downloads since Oct 1, 2014 (Information about access statistics)

More flexible radial layout.pdf 337

This item appears in the following Collection(s)

Search KOPS


My Account