Sciweavers

STOC
2006
ACM

Finding small balanced separators

14 years 11 months ago
Finding small balanced separators
Let G be an n-vertex graph that has a vertex separator of size k that partitions the graph into connected components of size smaller
Uriel Feige, Mohammad Mahdian
Added 03 Dec 2009
Updated 03 Dec 2009
Type Conference
Year 2006
Where STOC
Authors Uriel Feige, Mohammad Mahdian
Comments (0)