Delta-confluent drawings

Authors:
David Eppstein;Michael T. Goodrich;Jeremy Yu Meng
Affiliations:
School of Information and Computer Science, University of California, Irvine, Irvine, CA;School of Information and Computer Science, University of California, Irvine, Irvine, CA;School of Information and Computer Science, University of California, Irvine, Irvine, CA
Venue:
GD'05 Proceedings of the 13th international conference on Graph Drawing
Year:
2005

Citing 22
Cited 8

Distance-hereditary graphs

Journal of Combinatorial Theory Series B
Unit-length embedding of binary trees on a square grid

Information Processing Letters
A node-positioning algorithm for general trees

Software—Practice & Experience
Completely separable graphs

Discrete Applied Mathematics - Computational combinatiorics
A note on optimal area algorithms for upward drawings of binary trees

Computational Geometry: Theory and Applications
Area-efficient upward tree drawings

SCG '93 Proceedings of the ninth annual symposium on Computational geometry
A simple paradigm for graph recognition: application to cographs and distance hereditary graphs

Theoretical Computer Science
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Parallel h-v Drawings of Binary Trees

ISAAC '94 Proceedings of the 5th International Symposium on Algorithms and Computation
Simultaneous Embedding of a Planar Graph and Its Dual on the Grid

ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
A Graph Drawing and Translation Service on the WWW

GD '96 Proceedings of the Symposium on Graph Drawing
Optimizing Area and Aspect Ratio in Straight-Line Orthogonal Tree Drawings

GD '96 Proceedings of the Symposium on Graph Drawing
Hexagonal Grid Drawings

WG '92 Proceedings of the 18th International Workshop on Graph-Theoretic Concepts in Computer Science
The geometric thickness of low degree graphs

SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Tidier Drawings of Trees

IEEE Transactions on Software Engineering
Tidy Drawings of Trees

IEEE Transactions on Software Engineering
Area-efficient graph layouts

SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
Universality considerations in VLSI circuits

IEEE Transactions on Computers
Hexagonal grid drawings: algorithms and lower bounds

GD'04 Proceedings of the 12th international conference on Graph Drawing
Confluent layered drawings

GD'04 Proceedings of the 12th international conference on Graph Drawing
Simultaneous embedding of planar graphs with few bends

GD'04 Proceedings of the 12th international conference on Graph Drawing
Train tracks and confluent drawings

GD'04 Proceedings of the 12th international conference on Graph Drawing

Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data

IEEE Transactions on Visualization and Computer Graphics
Upright-quad drawing of st-planar learning spaces

GD'06 Proceedings of the 14th international conference on Graph drawing
Biclique edge cover graphs and confluent drawings

GD'06 Proceedings of the 14th international conference on Graph drawing
Dynamic distance hereditary graphs using split decomposition

ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Confluent drawing algorithms using rectangular dualization

GD'10 Proceedings of the 18th international conference on Graph drawing
Split decomposition and graph-labelled trees: Characterizations and fully dynamic algorithms for totally decomposable graphs

Discrete Applied Mathematics
Confluent hasse diagrams

GD'11 Proceedings of the 19th international conference on Graph Drawing
Planar and poly-arc lombardi drawings

GD'11 Proceedings of the 19th international conference on Graph Drawing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We generalize the tree-confluent graphs to a broader class of graphs called Δ-confluent graphs. This class of graphs and distance-hereditary graphs, a well-known class of graphs, coincide. Some results about the visualization of Δ-confluent graphs are also given.