๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs

โœ Scribed by Peter Eades; Qingwen Feng; Xuemin Lin; Hiroshi Nagamochi

Publisher
Springer
Year
2005
Tongue
English
Weight
422 KB
Volume
44
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An algorithm for straight-line represent
An algorithm for straight-line representation of simple planar graphs
โœ Lin Woo ๐Ÿ“‚ Article ๐Ÿ“… 1969 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 841 KB

An algorithm is developed for drawing straight-line planar graphs which are isomorphic to a convex polyhedron and simple (i.e. a connected graph with no self-loops or multiple branches). The construction of such graphs is outlined in three stages. Stage 1 determines all the independent cycles of the

Parallel Algorithms for Hierarchical Clu
Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition
โœ Elias Dahlhaus ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 306 KB

We present efficient parallel algorithms for two hierarchical clustering heuristics. We point out that these heuristics can also be applied to solving some algorithmic problems in graphs, including split decomposition. We show that efficient parallel split decomposition induces an efficient parallel