This paper presents 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. The algorithm… (More)

Three techniques in computational geometry are explored: <italic>Scaling</italic> solves a problem by viewing it at increasing levels of numerical precision; <italic>activation</italic> is a… (More)

This paper presents algorithms for the assignment problem, the transportation problem, and the minimum-cost flow problem of operations research. The algorithms find a minimum-cost solution, yet run… (More)

This paper shows that the weighted matching problem on general graphs can be solved in time O(n(m + n log n)), f or n and m the number of vertices and edges, respectively. This was previously known… (More)

An algorithm for minimum-cost matching on a general graph with integral edge costs is presented. The algorithm runs in time close to the fastest known bound for maximum-cardinality matching.… (More)

We present an algorithm that finds the edge connect ivity A of a directed graph in time O(Arn log (n2/rn)) and is slightly faster on an undi-rected graph (n and m denote the number of vertices a " nd… (More)

Efficient algorithms are given for the bidirected network flow problem and the degree-constrained subgraph problem. Four versions of each are solved, depending on whether edge… (More)

A network is a graph with numeric parameters such as edge lengths, capacities, costs, etc. We present efficient algorithms for network problems that work by scaling the numeric parameters. Scaling… (More)

A matching on a graph is a set of edges, no two of which share a vertex. A maximum matching contains the greatest number of edges possible. This paper presents an efficient implementation of Edmonds'… (More)