Finding All Useless Arcs in Directed Planar Graphs

arXiv: Data Structures and Algorithms, Volume abs/1702.04786, 2017.

Cited by: 0|Bibtex|Views4|Links
EI

Abstract:

We present a linear-time algorithm for simplifying flow networks on directed planar graphs: Given a directed planar graph on $n$ vertices, a source vertex $s$ and a sink vertex $t$, our algorithm removes all the arcs that do not participate in any simple $s,t$-path in linear-time. The output graph produced by our algorithm satisfies the p...More

Code:

Data:

Your rating :
0

 

Tags
Comments