Simultaneous Graph Embeddings with Fixed Edges
Authors:
- 1 January 2006
- book chapter
- Published by Springer Nature
- p. 325-335
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Two Trees Which Are Self–intersecting When Drawn SimultaneouslyLecture Notes in Computer Science, 2006
- Simultaneous Embedding of a Planar Graph and Its Dual on the GridTheory of Computing Systems, 2005
- An Interactive Multi-user System for Simultaneous Graph DrawingLecture Notes in Computer Science, 2005
- Simultaneous Embedding of Planar Graphs with Few BendsLecture Notes in Computer Science, 2005
- Simultaneous Graph Drawing: Layout Algorithms and Visualization SchemesLecture Notes in Computer Science, 2004
- Recognizing string graphs in NPJournal of Computer and System Sciences, 2003
- On Simultaneous Planar Graph Embeddings2003
- Crossing Number of Abstract Topological GraphsLecture Notes in Computer Science, 1998
- Noncrossing Subgraphs in Topological LayoutsSIAM Journal on Discrete Mathematics, 1991
- String graphs. II. recognizing string graphs is NP-hardJournal of Combinatorial Theory, Series B, 1991