Pages that link to "Item:Q1578391"
From MaRDI portal
The following pages link to Partitioning planar graphs with vertex costs: Algorithms and applications (Q1578391):
Displaying 7 items.
- Planar crossing numbers of graphs of bounded genus (Q452001) (← links)
- Algorithms for approximate shortest path queries on weighted polyhedral surfaces (Q603866) (← links)
- On cleaving a planar graph (Q917567) (← links)
- A quality and distance guided hybrid algorithm for the vertex separator problem (Q1652081) (← links)
- The vertex separator problem: a polyhedral investigation (Q2487852) (← links)
- Continuous quadratic programming formulations of optimization problems on graphs (Q2629636) (← links)
- Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem (Q5106375) (← links)
