Width-Optimal Visibility Representations of Plane Graphs

DOI10.1007/978-3-540-77120-3_16zbMATH Open1193.05114OpenAlexW2122592687MaRDI QIDQ5387754FDOQ5387754

Authors: Jia-Hao Fan, Chun-Cheng Lin, Hsueh-I Lu, Hsu-Chun Yen 

Publication date: 27 May 2008

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77120-3_16

Recommendations

• STACS 2004
• Improved visibility representation of plane graphs
• Nearly Optimal Visibility Representations of Plane Graphs
• Nearly Optimal Visibility Representations of Plane Graphs
• Graph Drawing

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• A unified approach to visibility representations of planar graphs
• Rectilinear planar layouts and bipolar orientations of planar graphs
• Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer
• Visibility representation of plane graphs via canonical ordering tree
• Nearly Optimal Visibility Representations of Plane Graphs
• Improved visibility representation of plane graphs
• AN APPLICATION OF WELL-ORDERLY TREES IN GRAPH DRAWING
• Compact visibility representation and straight-line grid embedding of plane graphs.
• Constructing compact rectilinear planar layouts using canonical representation of planar graphs
• Constrained visibility representations of graphs

Cited In (11)

• Visibility Representations of Four-Connected Plane Graphs with Near Optimal Heights
• AN APPLICATION OF WELL-ORDERLY TREES IN GRAPH DRAWING
• Title not available (Why is that?)
• Visibility representations of four-connected plane graphs with near optimal heights
• STACS 2004
• Visibility drawings of plane 3-trees with minimum area
• Compact visibility representation of 4-connected plane graphs
• Improved visibility representation of plane graphs
• Optimal-area visibility representations of outer-1-plane graphs
• Special graph representation and visualization of semantic networks
• Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer

This page was built for publication: Width-Optimal Visibility Representations of Plane Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5387754)