Inserting an edge into a geometric embedding
From MaRDI portal
Recommendations
Cites work
- A Geometric Heuristic for Rectilinear Crossing Minimization
- Crossing Number is NP-Complete
- Inserting a vertex into a planar graph
- Inserting an edge into a geometric embedding
- Inserting an edge into a planar graph
- Inserting multiple edges into a planar graph
- On shortest disjoint paths in planar graphs
- Parameterized algorithms
- Planarity Testing and Optimal Edge Insertion with Embedding Constraints
- Straight-Line Drawability of a Planar Graph Plus an Edge
- The directed subgraph homeomorphism problem
- The disjoint shortest paths problem
Cited in
(12)- Inserting an edge into a planar graph
- Inserting an edge into a planar graph
- An effective crossing minimisation heuristic based on star insertion
- Inserting multiple edges into a planar graph
- Inserting a vertex into a planar graph
- Quantitative restrictions on crossing patterns
- How to draw a planarization
- Linear-time algorithms for geometric graphs with sublinearly many edge crossings
- Inserting an edge into a geometric embedding
- Inserting an edge into a geometric embedding
- Inserting one edge into a simple drawing is hard
- Inserting Multiple Edges into a Planar Graph
This page was built for publication: Inserting an edge into a geometric embedding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5915946)