Pages that link to "Item:Q4268875"
From MaRDI portal
The following pages link to Finding Separator Cuts in Planar Graphs within Twice the Optimal (Q4268875):
Displaying 5 items.
- Spectral partitioning works: planar graphs and finite element meshes (Q869898) (← links)
- Balanced cut approximation in random geometric graphs (Q1029344) (← links)
- A quality and distance guided hybrid algorithm for the vertex separator problem (Q1652081) (← links)
- The vertex separator problem: a polyhedral investigation (Q2487852) (← links)
- Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem (Q5106375) (← links)
