From Tree to Graph - Experiments with E-Spring Algorithm
UTSePress Research/Manakin Repository
JavaScript is disabled for your browser. Some features of this site may not work without it.
- UTSePress Research Home
- >
- 12 Built Environment and Design
- >
- Book Chapters
- >
- General
- >
- View Item
| dc.contributor.author | Kumar Pushpa | en_US |
| dc.contributor.author | Huang Mao | en_US |
| dc.contributor.author | Zhang Kang | en_US |
| dc.contributor.editor | Huang, Mao Lin; Nguyen, Quang Vinh; Zhang, Kang | en_US |
| dc.date.accessioned | 2010-05-28T09:38:53Z | |
| dc.date.available | 2010-05-28T09:38:53Z | |
| dc.date.issued | 2010 | en_US |
| dc.identifier | 2009000957 | en_US |
| dc.identifier.citation | Kumar Pushpa, Zhang Kang, and Huang Mao 2010, 'From Tree to Graph - Experiments with E-Spring Algorithm', in http://dx.doi.org/10.1007/978-1-4419-0312-9_3 (ed.), Springer, La Vergne, TN USA, pp. 41-63. | en_US |
| dc.identifier.issn | 978-1-4419-0311-2 | en_US |
| 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 | en_US |
| dc.language | en_US | |
| dc.publisher | Springer | en_US |
| dc.relation.hasversion | Accepted manuscript version | en_US |
| dc.relation.isbasedon | http://dx.doi.org/10.1007/978-1-4419-0312-9_3 | en_US |
| dc.title | From Tree to Graph - Experiments with E-Spring Algorithm | en_US |
| dc.parent | Visual Information Communication | en_US |
| dc.journal.volume | en_US | |
| dc.journal.number | en_US | |
| dc.publocation | La Vergne, TN USA | en_US |
| 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 | 120307 | en_US |
| dc.personcode | 0000054804;0000054805;990771 | en_US |
| dc.percentage | 000100 | en_US |
| dc.classification.name | Visual Communication Design (incl. Graphic Design) | en_US |
| dc.classification.type | FOR-08 | en_US |
| dc.edition | first | en_US |
| dc.custom | 2009 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.staffid | University of Texas at Dallas | en_US |
