Drawing Clusters and Hierarchies

Cite This

Files in this item

Files Size Format View

There are no files associated with this item.

BROCKENAUER, Ralf, Sabine CORNELSEN, 2001. Drawing Clusters and Hierarchies. In: KAUFMANN, Michael, ed., Dorothea WAGNER, ed.. Drawing graphs : methods and models. Berlin:Springer, pp. 193-227. ISBN 978-3-540-42062-0. Available under: doi: 10.1007/3-540-44969-8_8

@incollection{Brockenauer2001-04-25Drawi-44787, title={Drawing Clusters and Hierarchies}, year={2001}, doi={10.1007/3-540-44969-8_8}, number={2025}, isbn={978-3-540-42062-0}, address={Berlin}, publisher={Springer}, series={Lecture Notes in Computer Science}, booktitle={Drawing graphs : methods and models}, pages={193--227}, editor={Kaufmann, Michael and Wagner, Dorothea}, author={Brockenauer, Ralf and Cornelsen, Sabine} }

<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/rdf/resource/123456789/44787"> <dc:creator>Cornelsen, Sabine</dc:creator> <dc:language>eng</dc:language> <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/44787"/> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2019-01-31T12:51:42Z</dc:date> <dcterms:abstract xml:lang="eng">Large graphs such as WWW connection graphs or VLSI schematics cannot be drawn in a readable way by traditional graph drawing techniques. An approach to solve this problem is, for example, fish-eye representation, which allows one to display a small part of the graph enlarged while the graph is shown completely (see e.g. Formella and Keller (1995)). Another way is drawing only a part of the graph. The method presented here is clustering, that is grouping the vertex set.</dcterms:abstract> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dc:contributor>Cornelsen, Sabine</dc:contributor> <dcterms:title>Drawing Clusters and Hierarchies</dcterms:title> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dc:creator>Brockenauer, Ralf</dc:creator> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2019-01-31T12:51:42Z</dcterms:available> <dc:contributor>Brockenauer, Ralf</dc:contributor> <dcterms:issued>2001-04-25</dcterms:issued> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> </rdf:Description> </rdf:RDF>

This item appears in the following Collection(s)

Search KOPS


Browse

My Account