Finding a feasible flow in a strongly connected network

@article{Haeupler2008FindingAF,
  title={Finding a feasible flow in a strongly connected network},
  author={Bernhard Haeupler and R. Tarjan},
  journal={Oper. Res. Lett.},
  year={2008},
  volume={36},
  pages={397-398}
}
We give a linear-time algorithm to find a feasible flow in a strongly connected network with fixed supplies and demands, each summing to a common value that is at most the minimum arc capacity. This algorithm speeds up the Goldberg-Rao maximum flow method by a constant factor. 
Ortho-Polygon Visibility Representations of Embedded Graphs
TLDR
It is argued that the existence and the vertex complexity of an OPVR of G are related to its number of crossings per edge and to its connectivity, and a family of 2-connected 1-plane graphs for which an embedding that guarantees constant vertex complexity can be computed is described. Expand
Ortho-polygon Visibility Representations of Embedded Graphs
TLDR
It is proved that if G has at most one crossing per edge, an OPVR of G always exists while this may not be the case if two crossings per edge are allowed, and a family of 2-connected 1-plane graphs for which an embedding that guarantees constant vertex complexity can be computed in O(n) time. Expand
Probabilistic methods for distributed information dissemination
TLDR
A novel highly efficient distributed implementation of RLNC is provided that achieves optimal performance guarantees for all settings considered in the literature and many more that were not analyzable so far while buffering only a minimal amount of information at intermediate nodes. Expand

References

SHOWING 1-7 OF 7 REFERENCES
Routing Flow Through a Strongly Connected Graph
TLDR
It is shown that, for every strongly connected network in which every edge has capacity at least Δ, linear time suffices to send flow from source vertices to sink vertices, provided that the total supply equals the total demand and is bounded by Δ. Expand
Depth-First Search and Linear Graph Algorithms
  • R. Tarjan
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 1972
The value of depth-first search or “backtracking” as a technique for solving problems is illustrated by two examples. An improved version of an algorithm for finding the strongly connected componentsExpand
Beyond the flow decomposition barrier
TLDR
Borders are improved for the Gomory-Hu tree problem, the parametric flow problem, and the approximate s-t cut problem by introducing a new approach to the maximum flow problem. Expand
A linear-time algorithm for a special case of disjoint set union
TLDR
A linear-time algorithm for the special case of the disjoint set union problem in which the structure of the unions (defined by a “union tree”) is known in advance, which gives similar improvements in the efficiency of algorithms for solving a number of other problems. Expand
Efficiency of a Good But Not Linear Set Union Algorithm
  • R. Tarjan
  • Mathematics, Computer Science
  • JACM
  • 1975
TLDR
It is shown that, if t(m, n) is seen as the maximum time reqmred by a sequence of m > n FINDs and n -- 1 intermixed UNIONs, then kima(m), n is shown to be related to a functional inverse of Ackermann's functmn and as very slow-growing. Expand
Routing Flow Through a Strongly
  • Connected Graph. Algorithmica,
  • 2002
Wheels within wheels