David W. Matula

TL;DR: Smallest-last vertex ordering and prlonty search are utdlzed to show for any graph G = (IT, E) that the set of all connected subgraphs maxunal with respect to their minimum degree can be determined in O(I EI + I VI) time and 21El + O (I VI) space.

TL;DR: A fully polynomial-time approximation scheme for the maximum concurrent flow problem is developed and the problem of associating costs to the edges so as to maximize the minimum-cost of routing the concurrent flow is the dual of the MCFP.

TL;DR: This chapter describes the concept of sequential colorings is formalized and certain upper bounds on the minimum number of colors needed to color a graph, the chromatic number x(G), and shows that the recursive-smallest-vertex-degree-last-ordering-with-interchange coloring algorithm will color any planar graph in five or fewer colors.

TL;DR: B bipartite reciprocal tables are described that employ separate table lookup of the positive and negative portions of a borrow-save reciprocal value, and typically provide a round-to-nearest reciprocal for over 90% of input arguments.