From Tree to Graph - Experiments with E-Spring Algorithm

DSpace/Manakin Repository

Search OPUS


Advanced Search

Browse

My Account

Show simple item record

dc.contributor.author Kumar, P
dc.contributor.author Zhang, K
dc.contributor.author Huang, M
dc.contributor.editor Huang, ML
dc.contributor.editor Nguyen, QV
dc.contributor.editor Zhang, K
dc.date.accessioned 2010-05-28T09:38:53Z
dc.date.issued 2010-01
dc.identifier.citation Visual Information Communication, 2010, first, pp. 41 - 63
dc.identifier.isbn 978-1-4419-0311-2
dc.identifier.other B1 en_US
dc.identifier.uri http://hdl.handle.net/10453/7911
dc.description.abstract Graph drawing and visualization represent structural information as diagrams of abstract graphs and networks. E-Spring Algorithm, derived from the popular spring embedder model, was proposed to eliminate node overlaps in the drawings of clustered directed acyclic graphs Gc. In this paper, we apply the E-Spring algorithm to general graphs by minimizing edge-node intersections. Initially, a tree structure is extracted from the original graph using the breadth-first search (BFS) algorithm. The extracted tree is then visualized without node overlaps using the E-Spring algorithm, and the remaining non-tree edges are appended to this visualization. A post-processing step that implements edge routing is performed on the obtained visualization to eliminate residual edge-node intersections. This method has been validated by visualizing eBay buyer-seller relationships and Graph Catalog benchmarking data
dc.publisher Springer
dc.relation.hasversion Accepted manuscript version en_US
dc.relation.isbasedon 10.1007/978-1-4419-0312-9_3
dc.title From Tree to Graph - Experiments with E-Spring Algorithm
dc.type Chapter
dc.parent Visual Information Communication
dc.journal.number en_US
dc.publocation La Vergne, TN USA en_US
dc.publocation La Vergne, TN USA
dc.publocation La Vergne, TN USA
dc.identifier.startpage 41 en_US
dc.identifier.endpage 63 en_US
dc.cauo.name FEIT.School of Software en_US
dc.conference Verified OK en_US
dc.for 0806 Information Systems
dc.personcode 990771
dc.percentage 100 en_US
dc.classification.name Information Systems en_US
dc.classification.type FOR-08 en_US
dc.edition first en_US
dc.edition first
dc.edition first
dc.custom Visual Information Communications International en_US
dc.date.activity 20090924 en_US
dc.location.activity Sydney en_US
dc.description.keywords node overlaps - edge-node intersections - edge routing - graph visualization en_US
dc.description.keywords node overlaps - edge-node intersections - edge routing - graph visualization
dc.description.keywords node overlaps - edge-node intersections - edge routing - graph visualization
pubs.embargo.period Not known
pubs.organisational-group /University of Technology Sydney
pubs.organisational-group /University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group /University of Technology Sydney/Faculty of Engineering and Information Technology/School of Software


Files in this item

This item appears in the following Collection(s)

Show simple item record