Sciweavers

FAW
2010
Springer
217views Algorithms» more  FAW 2010»
13 years 3 months ago
Path Separability of Graphs
In this paper we investigate the structural properties of k-path separable graphs, that are the graphs that can be separated by a set of k shortest paths. We identify several grap...
Emilie Diot, Cyril Gavoille
PODC
2006
ACM
13 years 10 months ago
Object location using path separators
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...
Ittai Abraham, Cyril Gavoille