Graph Theory with Applications to Engineering and Computer ... This outstanding introductory treatment of graph theory and its applications has had a long life in the instruction of advanced… Expand

The following problem is considered: Given an undirected, connected graph G, find a spanning tree in G such that the sum of the lengths of the fundamental cycles (with respect to this tree) is minimum.Expand

A brief description and comparison of all known algorithms for enumerating all circuits of graph is provided, and upper bounds on computation time of many algorithms are derived.Expand

We present a one-time treeconstruction algorithm that constructs a DCMST in a modified greedy fashion, employing a heuristic for selecting edges to be added to the tree at each stage of the tree construction.Expand

We present two O(log n)-time parallel algorithms — one for finding the maximum subsequence sum of a given sequence, and the other forfinding the maximum subarray sum of an array.Expand