Pages that link to "Item:Q5919618"
From MaRDI portal
The following pages link to Approximating small balanced vertex separators in almost linear time (Q5919618):
Displaying 6 items.
- On classes of graphs with strongly sublinear separators (Q1750205) (← links)
- Partitioning a graph into small pieces with applications to path transversal (Q2316611) (← links)
- Finding small balanced separators (Q2931401) (← links)
- Improved Approximation Algorithms for Minimum Weight Vertex Separators (Q3624379) (← links)
- Mildly Exponential Time Approximation Algorithms for Vertex Cover, Balanced Separator and Uniform Sparsest Cut (Q5009512) (← links)
- Approximating the exponential, the lanczos method and an Õ(<i>m</i>)-time spectral algorithm for balanced separator (Q5415541) (← links)