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

Full description

Bibliographic Details

Published in:	Annual Symposium on Foundations of Computer Science pp. 477 - 486
Main Authors:	Abboud, Amir, Dahlgaard, Soren
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.10.2016
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!