Pages that link to "Item:Q1774149"
From MaRDI portal
The following pages link to Inserting an edge into a planar graph (Q1774149):
Displayed 15 items.
- Crossing number and weighted crossing number of near-planar graphs (Q548655) (← links)
- Vertex insertion approximates the crossing number of apex graphs (Q661940) (← links)
- A branch-and-cut approach to the crossing number problem (Q951113) (← links)
- Non-planar core reduction of graphs (Q1011763) (← links)
- A tighter insertion-based approximation of the crossing number (Q2012882) (← links)
- How to Draw a Planarization (Q2971142) (← links)
- An effective crossing minimisation heuristic based on star insertion (Q3121515) (← links)
- Straight-Line Drawability of a Planar Graph Plus an Edge (Q3449828) (← links)
- A New Approach to Exact Crossing Minimization (Q3541091) (← links)
- Crossing and Weighted Crossing Number of Near-Planar Graphs (Q3611835) (← links)
- Approximating the Crossing Number of Apex Graphs (Q3611879) (← links)
- The Crossing Number of Graphs: Theory and Computation (Q3644730) (← links)
- Algorithms for the Hypergraph and the Minor Crossing Number Problems (Q5387756) (← links)
- Advances in the Planarization Method: Effective Multiple Edge Insertions (Q5895513) (← links)
- Inserting an edge into a geometric embedding (Q5915946) (← links)