On the Number of Minimum Size Separating Vertex Sets in a Graph and How to Find All of Them.

Arkady Kanevsky

Published in: SODA (1990)

Keyphrases

maximum number
small number
constant factor
memory requirements
edge weights
grow exponentially
computational complexity
undirected graph
real numbers
graph theory
spanning tree
minimum weight
approximation algorithms
disjoint sets
exponential size