Visibility Representations of Four-Connected Plane Graphs with Near Optimal Heights

DOI10.1007/978-3-642-00219-9_8zbMath1213.68433OpenAlexW1828585279MaRDI QIDQ3611838

Ya-Fei Hung, Chieh-Yu Chen, Hsueh-I Lu

Publication date: 3 March 2009

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00219-9_8

Mathematics Subject Classification ID

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) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (2)

Special graph representation and visualization of semantic networks ⋮ Compact visibility representation of 4-connected plane graphs

Cites Work

• Improved visibility representation of plane graphs
• A unified approach to visibility representations of planar graphs
• Rectilinear planar layouts and bipolar orientations of planar graphs
• Computing an st-numbering
• Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
• Canonical ordering trees and their applications in graph drawing
• Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer
• Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings
• STACS 2004
• Width-Optimal Visibility Representations of Plane Graphs
• Optimal st-Orientations for Plane Triangulations
• Graph Drawing
• Algorithms and Data Structures
• Nearly Optimal Visibility Representations of Plane Graphs
• Nearly Optimal Visibility Representations of Plane Graphs

This page was built for publication: Visibility Representations of Four-Connected Plane Graphs with Near Optimal Heights