Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels
Data and Resources
Additional Info
| Field | Value |
|---|---|
| Source | 44th Annual ACM Symposium on Theory of Computing (STOC) |
| Author | Abraham, Ittai, Chechik, Shiri, Gavoille, Cyril |
| Maintainer | CCSD |
| Last Updated | November 4, 2026, 01:51 (UTC) |
| Created | November 4, 2026, 01:51 (UTC) |
| Identifier | hal-00725839 |
| Language | en |
| contributor | Microsoft Research Silicon Valley ; Microsoft Corporation [Redmond, Wash.] |
| coverage | New-York, United States |
| creator | Abraham, Ittai |
| date | 2012-05-04T00:00:00 |
| harvest_object_id | 6b88cc17-d841-4408-a357-7d2cc1778d98 |
| harvest_source_id | 3374d638-d20b-4672-ba96-a23232d55657 |
| harvest_source_title | test moissonnage SELUNE |
| metadata_modified | 2025-05-26T00:00:00 |
| relation | info:eu-repo/semantics/altIdentifier/doi/10.1145/2213977.2214084 |
| set_spec | type:COMM |