AN APPLICATION OF WELL-ORDERLY TREES IN GRAPH DRAWING
From MaRDI portal
Publication:5493898
DOI10.1142/S0129054106004303zbMath1100.68086OpenAlexW2793435525MaRDI QIDQ5493898
Publication date: 16 October 2006
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054106004303
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (max. 100)
Visibility representations of four-connected plane graphs with near optimal heights ⋮ Planar polyline drawings via graph transformations ⋮ Good spanning trees in graph drawing ⋮ Width-Optimal Visibility Representations of Plane Graphs ⋮ Visibility drawings of plane 3-trees with minimum area
Cites Work
- Improved visibility representation of plane graphs
- How to draw a planar graph on a grid
- Visibility representation of plane graphs via canonical ordering tree
- A unified approach to visibility representations of planar graphs
- Rectilinear planar layouts and bipolar orientations of planar graphs
- Planar graphs and poset dimension
- Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
- Canonical ordering trees and their applications in graph drawing
- Drawing planar graphs using the canonical ordering
- Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding and Generation
- Compact floor-planning via orderly spanning trees
- An Optimal Algorithm for the Maximum-Density Segment Problem
- Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer
- Drawing graphs. Methods and models
This page was built for publication: AN APPLICATION OF WELL-ORDERLY TREES IN GRAPH DRAWING
