Popular Conjectures as a Barrier for Dynamic Planar Graph Algorithms

The dynamic shortest paths problem on planar graphs asks us to preprocess a planar graph G such that we may support insertions and deletions of edges in G as well as distance queries between any two nodes u, v subject to the constraint that the graph remains planar at all times. This problem has bee...

Celý popis

Podrobná bibliografia

Vydané v:	Annual Symposium on Foundations of Computer Science s. 477 - 486
Hlavní autori:	Abboud, Amir, Dahlgaard, Soren
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.10.2016
Predmet:	all pairs shortest paths Complexity theory Computer science conditional lower bounds dynamic distance oracles hardness in p Heuristic algorithms Labeling planar graphs Roads Runtime Shortest path problem
ISSN:	0272-5428
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!