Optimal labelling for connectivity checking in planar networks with obstacles
Résumé
With labels of size O(log(n)) for a planar graph, one can check if two vertices are in the same connected component of a subgraph specified by the labels of its deleted vertices and edges.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|---|
| Licence |