6 search results - page 2 / 2 » Fast and Compact Oracles for Approximate Distances in Planar... |
PODC
2006
ACM
13 years 10 months ago
2006
ACM
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...