16 search results - page 4 / 4 » GRECS: Graph Encryption for Approximate Shortest Distance Qu... |
PODC
2006
ACM
13 years 11 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...