Optimal labelling for connectivity checking in planar networks with obstacles
Overview & Synopsis
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.
Indexed from repository: HAL Open Science
(
hal.science)
Keyboard Shortcuts:
← / → for pages • + / - for zoom • 0 to fit width
Powered by Mozilla PDF.js v3.11
Document Information
| Document Title | Optimal labelling for connectivity checking in planar networks with obstacles |
|---|---|
| Author / Organization | Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté, Andrew Twigg |
| Subject & Discipline | Multidisciplinary Academic Open Research |
| Categories | Science & Mathematics |
| Publication Year | 2009 |
| License / Rights | Open Access / Creative Commons |
| Resource Verification | Listed PDF (Verification Pending) |
| Original Host Website |
HAL Open Science
(hal.science)
|
| File Format | application/pdf (Portable Document Format) |
| Language | EN |
| Catalog ID | DOC-45549 |
| Original Source Link | Visit Source Page on hal.science » |