Add to ORKGThe vitality of an edge in a graph with respect to the maximum flow between two fixed vertices $s$ and $t$ is defined as the reduction of the maximum flow value caused by the removal of that edge. The max-flow vitality problem has already been efficiently solved for $st$-planar graphs but has remained open for general planar graphs. For the first time our result provides an optimal solution for general planar graphs although restricted to the case of unweighted planar graphs
Abstract. Minimum cuts have been closely related to shortest paths in planar graphs via planar duali...
Abstract. We study the maximum flow problem in directed H-minor-free graphs where H can be drawn in ...
Let G be a graph, and let e be an edge of G. The main result of this paper is that any instance of ...
We show a fast algorithm for determining the set of relevant edges in a planar undirected unweighted...
We study the problem of computing the vitality of edges and vertices with respect to $st$-max flow i...
We study the problem of computing the vitality of edges and vertices with respect to the $st$-max fl...
The vitality of an arc/node of a graph with respect to the maximum flow between two fixed nodes s an...
Abstract. In this paper we present an O(n log n) algorithm for finding a maximum flow in a directed ...
We study the maximum flow problem in an undirected planar network with both edge and vertex capaciti...
We give an O(n1.5 logn) time algorithm for finding the maximum flow in a directed planar graph with ...
In this paper we present the maximum flow algorithm in O(n log n) for directed planar graphs of Glen...
AbstractWe give a linear-time algorithm for single-source shortest paths in planar graphs with nonne...
Let G(V, E, w) be an undirected, weighted, connected simple graph. Let P be a minimization problem i...
Abstract. We develop a new technique for computing maximum flow in directed planar graphs with multi...
Max-flow in planar graphs has always been studies with the assumption that there are capacities onl...
Abstract. Minimum cuts have been closely related to shortest paths in planar graphs via planar duali...
Abstract. We study the maximum flow problem in directed H-minor-free graphs where H can be drawn in ...
Let G be a graph, and let e be an edge of G. The main result of this paper is that any instance of ...
We show a fast algorithm for determining the set of relevant edges in a planar undirected unweighted...
We study the problem of computing the vitality of edges and vertices with respect to $st$-max flow i...
We study the problem of computing the vitality of edges and vertices with respect to the $st$-max fl...
The vitality of an arc/node of a graph with respect to the maximum flow between two fixed nodes s an...
Abstract. In this paper we present an O(n log n) algorithm for finding a maximum flow in a directed ...
We study the maximum flow problem in an undirected planar network with both edge and vertex capaciti...
We give an O(n1.5 logn) time algorithm for finding the maximum flow in a directed planar graph with ...
In this paper we present the maximum flow algorithm in O(n log n) for directed planar graphs of Glen...
AbstractWe give a linear-time algorithm for single-source shortest paths in planar graphs with nonne...
Let G(V, E, w) be an undirected, weighted, connected simple graph. Let P be a minimization problem i...
Abstract. We develop a new technique for computing maximum flow in directed planar graphs with multi...
Max-flow in planar graphs has always been studies with the assumption that there are capacities onl...
Abstract. Minimum cuts have been closely related to shortest paths in planar graphs via planar duali...
Abstract. We study the maximum flow problem in directed H-minor-free graphs where H can be drawn in ...
Let G be a graph, and let e be an edge of G. The main result of this paper is that any instance of ...