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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Annual Symposium on Foundations of Computer Science S. 477 - 486
Hauptverfasser:	Abboud, Amir, Dahlgaard, Soren
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	IEEE 01.10.2016
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!