algorithms-optimization / Planar graph algorithms
Three immediate consequences follow for undirected unweighted planar graphs: better compression of the Okamura-Seymour metric, less space for constant-time exact distance oracles, and a faster distributed algorithm.
Temporal state
No reconciled state yet.
Append-only history
Three immediate consequences follow for undirected unweighted planar graphs: better compression of the Okamura-Seymour metric, less space for constant-time exact distance oracles, and a faster distributed algorithm.
Research memory
Three immediate consequences follow for undirected unweighted planar graphs: better compression of the Okamura-Seymour metric, less space for constant-time exact distance oracles, and a faster distributed algorithm.
Three immediate consequences follow for undirected unweighted planar graphs: better compression of the Okamura-Seymour metric, less space for constant-time exact distance oracles, and a faster distributed algorithm.
Evidence graph
parent of · event · claim reported