Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Bindhu, S. Hima"'
For a connected graph, a vertex separator is a set of vertices whose removal creates at least two components. A vertex separator $S$ is minimal if it contains no other separator as a strict subset and a minimum vertex separator is a minimal vertex se
Externí odkaz:
http://arxiv.org/abs/1408.3977
