Compact visibility representation of 4-connected plane graphs

DOI10.1016/J.TCS.2012.02.010zbMATH Open1246.05108OpenAlexW2100920597MaRDI QIDQ443715FDOQ443715

Authors: Jiun-Jie Wang, Huaming Zhang, Xin He 

Publication date: 13 August 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.02.010

Recommendations

• Compact visibility representation of 4-connected plane graphs
• Compact visibility representation of plane graphs
• Visibility representation of plane graphs with simultaneous bound for both width and height
• Nearly Optimal Visibility Representations of Plane Graphs
• STACS 2004

zbMATH Keywords

plane graphvisibility representationplane triangulation\(st\)-orientation

Mathematics Subject Classification ID

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
• Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
• Title not available (Why is that?)
• Canonical ordering trees and their applications in graph drawing
• Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer
• NP-completeness of st-orientations for plane graphs
• Parameterized st-Orientations of Graphs: Algorithms and Experiments
• Title not available (Why is that?)
• Optimal \(st\)-orientations for plane triangulations
• Visibility representation of plane graphs via canonical ordering tree
• On triangulating planar graphs under the four-connectivity constraint
• Visibility Representations of Four-Connected Plane Graphs with Near Optimal Heights
• Width-Optimal Visibility Representations of Plane Graphs
• Graph Drawing
• Graph Drawing
• Nearly Optimal Visibility Representations of Plane Graphs
• Improved visibility representation of plane graphs
• Algorithms for computing a parameterized \(st\)-orientation

Cited In (8)

• Visibility Representations of Four-Connected Plane Graphs with Near Optimal Heights
• Visibility representations of four-connected plane graphs with near optimal heights
• Compact visibility representation of 4-connected plane graphs
• Simultaneous visibility representations of plane \(st\)-graphs using L-shapes
• Compact visibility representation of plane graphs
• Optimal \(st\)-orientations for plane triangulations
• Skyscraper polytopes and realizations of plane triangulations
• Optimal st-Orientations for Plane Triangulations

This page was built for publication: Compact visibility representation of 4-connected plane graphs

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