Planarity Testing and Optimal Edge Insertion with Embedding Constraints
From MaRDI portal
Publication:5301429
DOI10.7155/JGAA.00160zbMATH Open1161.68670OpenAlexW2141767607MaRDI QIDQ5301429FDOQ5301429
Authors: Carsten Gutwenger, Karsten Klein, Petra Mutzel
Publication date: 19 January 2009
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/55415
Recommendations
Cited In (14)
- Title not available (Why is that?)
- Characterizing planar tanglegram layouts and applications to edge insertion problems
- Beyond Clustered Planar Graphs
- Simultaneous embedding of embedded planar graphs
- Synchronized Planarity with Applications to Constrained Planarity Problems
- Inserting an edge into a geometric embedding
- Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges
- Inserting an edge into a geometric embedding
- Parameterized complexity of graph planarity with restricted cyclic orders
- Parameterized complexity of graph planarity with restricted cyclic orders
- Planarity Testing and Optimal Edge Insertion with Embedding Constraints
- Planar Graphs with Topological Constraints
- Visual Analysis of One-to-Many Matched Graphs
- Strip planarity testing for embedded planar graphs
This page was built for publication: Planarity Testing and Optimal Edge Insertion with Embedding Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301429)