Pages that link to "Item:Q2980925"
From MaRDI portal
The following pages link to Finding Triangles for Maximum Planar Subgraphs (Q2980925):
Displaying 10 items.
- Star-struck by fixed embeddings: modern crossing number heuristics (Q2151428) (← links)
- (Q4414480) (← links)
- (Q5009576) (← links)
- Triangulating planar graphs while minimizing the maximum degree (Q5056146) (← links)
- (Q5090466) (← links)
- (Q5140734) (← links)
- Finding Maximal Sets of Laminar 3-Separators in Planar Graphs in Linear Time (Q5236218) (← links)
- Use of MAX-CUT for Ramsey Arrowing of Triangles (Q5412357) (← links)
- Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics (Q5886037) (← links)
- An improved algorithm for finding maximum outerplanar subgraphs (Q6184327) (← links)