OpenAlex
An O ( n log n ) algorithm for maximum st -flow in a directed planar graph
Work
Year: 2009
Type: article
Institution Brown University
Cites: 35
Cited by: 90
Related to: 10
FWCI: 9.627
Citation percentile (by year/subfield): 97.58
Open Access status: closed
Grant ID CCF-0635089