Worst-Case Update Times for Fully-Dynamic All-Pairs Shortest Paths
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
| Translated title of the contribution | Worst-Case Update Times for Fully-Dynamic All-Pairs Shortest Paths |
|---|---|
| Original language | English |
| Title of host publication | Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC) |
| Number of pages | 8 |
| Publisher | Association for Computing Machinery |
| Publication date | 2005 |
| Pages | 112-119 |
| DOIs | |
| Publication status | Published - 2005 |
| Externally published | Yes |
ID: 98323586