Sciweavers

STOC
2006
ACM
106views Algorithms» more  STOC 2006»
14 years 5 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