Simultaneous Embedding of Planar Graphs with Few Bends
- 1 January 2005
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- Vol. 9 (3) , 195-205
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- The geometric thickness of low degree graphs2004
- Visual unrolling of network evolution and the analysis of dynamic discourse2003
- On Simultaneous Planar Graph Embeddings2003
- Embedding Vertices at Points: Few Bends Suffice for Planar GraphsJournal of Graph Algorithms and Applications, 2002
- Geometric Thickness of Complete GraphsJournal of Graph Algorithms and Applications, 2000
- The Thickness of Graphs: A SurveyGraphs and Combinatorics, 1998
- How to draw a planar graph on a gridCombinatorica, 1990
- The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphsJournal of Algorithms, 1989
- Arboricity and Subgraph Listing AlgorithmsSIAM Journal on Computing, 1985
- Efficient Planarity TestingJournal of the ACM, 1974