scientific article; zbMATH DE number 2084266
From MaRDI portal
Publication:3043705
zbMATH Open1054.68573MaRDI QIDQ3043705FDOQ3043705
Authors: Giuseppe Di Battista, Walter Didimo, A. Marcandalli 
Publication date: 6 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2265/22650060.htm
Title of this publication is not available (Why is that?)
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cited In (21)
- Completely connected clustered graphs
- Clustered planarity = flat clustered planarity
- On embedding a cycle in a plane graph
- Planarity of Overlapping Clusterings Including Unions of Two Partitions
- Relaxing the constraints of clustered planarity
- Computing Maximum C-Planar Subgraphs
- Clustered Planarity: Clusters with Few Outgoing Edges
- Correlation clustering and two-edge-connected augmentation for planar graphs
- The effect of planarization on width
- Drawing Clustered Graphs on an Orthogonal Grid
- Clustered Planarity with Pipes
- Title not available (Why is that?)
- C-planarity testing of embedded clustered graphs with bounded dual carving-width
- Graph Drawing
- The effect of planarization on width
- Clustered Planarity: Small Clusters in Eulerian Graphs
- A note on obstructions to clustered planarity
- A new perspective on clustered planarity as a combinatorial embedding problem
- Shrinking the search space for clustered planarity
- Planarity-preserving clustering and embedding for large planar graphs
- Title not available (Why is that?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3043705)
