On the public citation graph
Min st -Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time
0 signed · 57 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/andp.18471481202openalex-snapshot
Ueber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Ströme geführt wird
inferredcites →https://doi.org/10.1006/jcss.1997.1493openalex-snapshot
Faster Shortest-Path Algorithms for Planar Graphs
inferredcites →https://doi.org/10.1007/3-540-55706-7_22openalex-snapshot
Triangulating planar graphs while minimizing the maximum degree
inferredcites →https://doi.org/10.1007/978-3-540-87744-8_47openalex-snapshot
Path Minima in Incremental Unrooted Trees
inferredcites →https://doi.org/10.1007/978-3-642-04128-0_28openalex-snapshot
Breaking the O(m 2 n) Barrier for Minimum Cycle Bases
inferredcites →https://doi.org/10.1007/bf02579206openalex-snapshot
Matching is as easy as matrix inversion
inferredcites →https://doi.org/10.1016/0022-0000(86)90030-9openalex-snapshot
Finding small simple cycle separators for 2-connected planar graphs
inferredcites →https://doi.org/10.1016/j.jcss.2005.05.007openalex-snapshot
Planar graphs, negative weight edges, shortest paths, and near linear time
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1137/0212005openalex-snapshot
Minimum s - t Cut of a Planar Undirected Network in $O(n\log ^2 (n))$ Time
inferredcites →https://doi.org/10.1137/0216026openalex-snapshot
A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
inferredcites →https://doi.org/10.1137/0216064openalex-snapshot
Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
inferredcites →https://doi.org/10.1137/s0895480190177042openalex-snapshot
The All-Pairs Min Cut Problem and the Minimum Cycle Basis Problem on Planar Graphs
inferredcites →https://doi.org/10.1145/1103963.1103966openalex-snapshot
Maintaining information in fully dynamic trees with top trees
inferredcites →https://doi.org/10.1145/1250790.1250879openalex-snapshot
An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs
inferredcites →https://doi.org/10.1145/1502793.1502798openalex-snapshot
An O ( n log n ) algorithm for maximum st -flow in a directed planar graph
inferredcites →https://doi.org/10.1145/1993636.1993679openalex-snapshot
Improved algorithms for min cut and max flow in undirected planar graphs
inferredcites →https://doi.org/10.1145/2488608.2488672openalex-snapshot
Structured recursive separator decompositions for planar graphs in linear time
inferredcites →https://doi.org/10.1145/28395.383347openalex-snapshot
Matching is as easy as matrix inversion
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-319-12340-0_20openalex-snapshot
Near-Linear Time Constant-Factor Approximation Algorithm for Branch-Decomposition of Planar Graphs
inferred← citeshttps://doi.org/10.1016/j.cosrev.2025.100867openalex-snapshot
Interdiction in network maximum flow and related problems: A survey
inferred← citeshttps://doi.org/10.1016/j.dam.2018.08.027openalex-snapshot
Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs
inferred← citeshttps://doi.org/10.1016/j.jcss.2021.09.008openalex-snapshot
Single-source shortest paths and strong connectivity in dynamic planar graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.10.034openalex-snapshot
Faster shortest paths in dense distance graphs, with applications
inferred← citeshttps://doi.org/10.1109/focs.2010.63openalex-snapshot
Min st-cut Oracle for Planar Graphs with Near-Linear Preprocessing Time
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00019openalex-snapshot
Cut-Equivalent Trees are Optimal for Min-Cut Queries
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00111openalex-snapshot
A Nearly Optimal All-Pairs Min-Cuts Algorithm in Simple Graphs
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00112openalex-snapshot
APMF < APSP? Gomory-Hu Tree for Unweighted Graphs in Almost-Quadratic Time
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00088openalex-snapshot
Breaking the Cubic Barrier for All-Pairs Max-Flow: Gomory-Hu Tree in Nearly Quadratic Time
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00137openalex-snapshot
All-Pairs Max-Flow is no Harder than Single-Pair Max-Flow: Gomory-Hu Trees in Almost-Linear Time
inferred← citeshttps://doi.org/10.1109/sbac-pad.2012.37openalex-snapshot
A Parallel Implementation of Gomory-Hu's Cut Tree Algorithm
inferred← citeshttps://doi.org/10.1137/1.9781611977066.1openalex-snapshot
A Simple Algorithm for Multiple-Source Shortest Paths in Planar Digraphs
inferred← citeshttps://doi.org/10.1137/120864271openalex-snapshot
Multiple-Source Shortest Paths in Embedded Graphs
inferred← citeshttps://doi.org/10.1137/16m1057152openalex-snapshot
Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths
inferred← citeshttps://doi.org/10.1137/21m1463379openalex-snapshot
Approximate Gomory–Hu Tree is Faster than \(\boldsymbol{n}\,\boldsymbol{-\, 1}\) Maximum Flows
inferred← citeshttps://doi.org/10.1145/1810959.1810988openalex-snapshot
Finding shortest non-trivial cycles in directed graphs on surfaces
inferred← citeshttps://doi.org/10.1145/3022730openalex-snapshot
Fault-Tolerant Approximate BFS Structures
inferred← citeshttps://doi.org/10.1145/3055399.3055480openalex-snapshot
Decremental single-source reachability in planar digraphs
inferred← citeshttps://doi.org/10.1145/3188745.3188904openalex-snapshot
Holiest minimum-cost paths and flows in surface graphs
inferred← citeshttps://doi.org/10.1145/3406325.3451073openalex-snapshot
Subcubic algorithms for Gomory–Hu tree in unweighted graphs
inferred← citeshttps://doi.org/10.1145/3406325.3451112openalex-snapshot
Approximate Gomory–Hu tree is faster than n – 1 max-flows
inferred← citeshttps://doi.org/10.1145/3511541openalex-snapshot
Exact Distance Oracles for Planar Graphs with Failing Vertices
inferred← citeshttps://doi.org/10.1145/3580474openalex-snapshot
Almost Optimal Exact Distance Oracles for Planar Graphs
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2018.61openalex-snapshot
Improved Bounds for Shortest Paths in Dense Distance Graphs
inferred← citeshttps://doi.org/10.4230/lipics.socg.2016.22openalex-snapshot
All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1303.0728openalex-snapshot
Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time
inferred← citeshttps://doi.org/10.48550/arxiv.1407.6761openalex-snapshot
Near-Linear Time Constant-Factor Approximation Algorithm for Branch-Decomposition of Planar Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1607.05112openalex-snapshot
Minimum cycle and homology bases of surface embedded graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1705.11163openalex-snapshot
Decremental Single-Source Reachability in Planar Digraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1706.00880openalex-snapshot
Cycle flow formulation of optimal network flow problems for centralized and decentralized solvers
inferred← citeshttps://doi.org/10.5281/zenodo.23257148openalex-snapshot
Decremental Transitive Closure and Shortest Paths for Planar Digraphs and Beyond
inferred← citeshttps://doi.org/10.7155/jgaa.00325openalex-snapshot
Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time
inferred← citeshttps://doi.org/10.7301/z0hd7t0fopenalex-snapshot
Efficient Algorithms for Shortest-Path and Maximum-Flow Problems in Planar Graphs
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.