Graph Drawing
From MaRDI portal
Publication:5897632
DOI10.1007/11618058zbMath1171.68617OpenAlexW4251892597MaRDI QIDQ5897632
Jonathan Z. Sun, Michael T. Goodrich, George S. Lueker
Publication date: 13 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11618058
Analysis of algorithms and problem complexity (68Q25) 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)
Related Items (16)
Straight-Line Rectangular Drawings of Clustered Graphs ⋮ Advances on Testing C-Planarity of Embedded Flat Clustered Graphs ⋮ A new perspective on clustered planarity as a combinatorial embedding problem ⋮ \(c\)-planarity of embedded cyclic \(c\)-graphs ⋮ Straight-line rectangular drawings of clustered graphs ⋮ Embedding graphs into embedded graphs ⋮ Clustered planarity = flat clustered planarity ⋮ Relaxing the constraints of clustered planarity ⋮ Clustered Planarity: Clusters with Few Outgoing Edges ⋮ Computing Maximum C-Planar Subgraphs ⋮ Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters ⋮ C-planarity testing of embedded clustered graphs with bounded dual carving-width ⋮ On embedding a cycle in a plane graph ⋮ Bounded Embeddings of Graphs in the Plane ⋮ Beyond Clustered Planar Graphs ⋮ Embedding Graphs into Embedded Graphs
This page was built for publication: Graph Drawing