Pages that link to "Item:Q1774149"
From MaRDI portal
The following pages link to Inserting an edge into a planar graph (Q1774149):
Displaying 16 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)
- 1-planarity testing and embedding: an experimental study (Q2088879) (← links)
- Star-struck by fixed embeddings: modern crossing number heuristics (Q2151428) (← links)
- Extending simple drawings (Q2206853) (← links)
- Toroidal grid minors and stretch in embedded graphs (Q2284733) (← links)
- How to Draw a Planarization (Q2971142) (← links)
- An effective crossing minimisation heuristic based on star insertion (Q3121515) (← links)
- (Q5075824) (← links)
- How to Draw a Planarization (Q5233140) (← links)
- Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics (Q5886037) (← links)
- (Q6065397) (← links)
- Inserting Multiple Edges into a Planar Graph (Q6075710) (← links)
