Pages that link to "Item:Q2012882"
From MaRDI portal
The following pages link to A tighter insertion-based approximation of the crossing number (Q2012882):
Displaying 18 items.
- Vertex insertion approximates the crossing number of apex graphs (Q661940) (← links)
- On maximum common subgraph problems in series-parallel graphs (Q1678090) (← links)
- Crossing numbers and stress of random graphs (Q1725756) (← links)
- A tighter insertion-based approximation of the crossing number (Q2012882) (← links)
- Star-struck by fixed embeddings: modern crossing number heuristics (Q2151428) (← links)
- Parameterized analysis and crossing minimization problems (Q2172859) (← links)
- Exact crossing number parameterized by vertex cover (Q2206863) (← links)
- Toroidal grid minors and stretch in embedded graphs (Q2284733) (← links)
- (Q3012797) (redirect page) (← links)
- An effective crossing minimisation heuristic based on star insertion (Q3121515) (← links)
- Approximation Algorithms for Euler Genus and Related Problems (Q4581910) (← links)
- (Q5009576) (← links)
- (Q5140734) (← links)
- Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics (Q5886037) (← links)
- Advances in the Planarization Method: Effective Multiple Edge Insertions (Q5895513) (← links)
- Inserting an edge into a geometric embedding (Q5918441) (← links)
- On the bond polytope (Q6060889) (← links)
- Inserting Multiple Edges into a Planar Graph (Q6075710) (← links)
