Topological morphing of planar graphs
From MaRDI portal
Publication:386891
DOI10.1016/j.tcs.2013.08.018zbMath1278.05078OpenAlexW4213088702MaRDI QIDQ386891
Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani, Patrizio Angelini
Publication date: 11 December 2013
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://link.springer.com/chapter/10.1007/978-3-642-00219-9_15
Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph
- Finding a minimum-depth embedding of a planar graph in \(O(n^{4})\) time
- On the complexity of embedding planar graphs to minimize certain distance measures
- Deformations of plane graphs
- Advances on sorting by reversals
- Representations by contact and intersection of segments
- Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
- Morphing Planar Graph Drawings Efficiently
- Morphing Planar Graph Drawings with Bent Edges
- Determining the Smallest k Such That G Is k-Outerplanar
- Computing orthogonal drawings with the minimum number of bends
- On-Line Planarity Testing
- h-Quasi Planar Drawings of Bounded Treewidth Graphs in Linear Area
- Morphing Planar Graphs in Spherical Space
- Morphing Planar Graph Drawings with a Polynomial Number of Steps
- Deformations of Plane Rectilinear Complexes
- Graph Drawing
- Graph Drawing
- Algorithms and Data Structures
- Morphing orthogonal planar graph drawings
This page was built for publication: Topological morphing of planar graphs
