OPTIMAL REDUCTION OF TWO-TERMINAL DIRECTED ACYCLIC GRAPHS *

Algorithms for series-parallel graphs can be extended to arbitrary two-terminal dags if node reductions are used along with series and parallel reductions. A node reduction contracts a vertex with unit in-degree (out-degree) into its sole incoming (outgoing) neighbor. This paper gives an O(n2"5) algorithm for minimizing node reductions, based on vertex cover in a transitive auxiliary graph. Applications include the analysis of PERT networks, dynamic programming approaches to network problems, and network reliability. For NP-hard problems one can obtain algorithms that are exponential only in the minimum number of node reductions rather than the number of vertices. This gives improvements if the underlying graph is nearly series-parallel.

[1]  Salah E. Elmaghraby,et al.  Activity networks: Project planning and control by network models , 1977 .

[2]  R. Z. Norman,et al.  Some properties of line digraphs , 1960 .

[3]  Hussein M. Abdel-Wahab,et al.  Scheduling to Minimize Maximum Cumulative Cost Subject to Series-Parallel Precedence Constraints , 1978, Oper. Res..

[4]  D. R. Robinson.  A Dynamic Programming Solution to Cost-Time Tradeoff for CPM , 1975 .

[5]  Refael Hassin,et al.  Efficient algorithms for optimization and selection on series-parallel graphs , 1986 .

[6]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[7]  Eugene L. Lawler,et al.  Linear-Time Computation of Optimal Subgraphs of Decomposable Graphs , 1987, J. Algorithms.

[8]  Clyde L. Monma,et al.  Sequencing with Series-Parallel Precedence Constraints , 1979, Math. Oper. Res..

[9]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[10]  Appajosyula Satyanarayana,et al.  A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks , 1985, SIAM J. Comput..

[11]  Robert E. Tarjan,et al.  Dividing a Graph into Triconnected Components , 1973, SIAM J. Comput..

[12]  Narsingh Deo,et al.  Complexity of the minimum-dummy-activities problem in a pert network , 1979, Networks.

[13]  Maciej M. Syslo,et al.  NP-Complete Problems on Some Tree-Structured Graphs: a Review , 1983, WG.

[14]  Eugene L. Lawler,et al.  The recognition of Series Parallel digraphs , 1979, SIAM J. Comput..

[15]  Neil Robertson,et al.  Disjoint Paths—A Survey , 1985 .

[16]  R. Duffin.  Topology of series-parallel networks , 1965 .

[17]  S. Lane.  A structural characterization of planar combinatorial graphs , 1937 .

[18]  Jacobo Valdes Ayesta.  Parsing flowcharts and series-parallel graphs , 1978 .

[19]  David S. Johnson,et al.  The NP-Completeness Column: An Ongoing Guide , 1982, J. Algorithms.

[20]  Robert E. Tarjan,et al.  Computing an st -Numbering , 1976, Theor. Comput. Sci..

[21]  Tohru Kikuno,et al.  A linear algorithm for the domination number of a series-parallel graph , 1983, Discret. Appl. Math..

[22]  Peter Brucker,et al.  Minimum cost flow algorithms for series-parallel networks , 1985, Discret. Appl. Math..

[23]  Clyde L. Monma.  The Two-Machine Maximum Flow Time Problem with Series-Parallel Precedence Constraints: An Algorithm and Extensions , 1979, Oper. Res..

[24]  Don Coppersmith,et al.  Matrix multiplication via arithmetic progressions , 1987, STOC.

[25]  Michael R. Fellows,et al.  Nonconstructive Advances in Polynomial-Time Complexity , 1987, Inf. Process. Lett..

[26]  Shirley Dex,et al.  JR 旅客販売総合システム（マルス）における運用及び管理について , 1991 .

[27]  Jeremy P. Spinrad,et al.  On Comparability and Permutation Graphs , 1985, SIAM J. Comput..

[28]  R. Kevin Wood.  Factoring Algorithms for Computing K-Terminal Network Reliability , 1986, IEEE Transactions on Reliability.

[29]  J. Scott Provan,et al.  The Complexity of Reliability Computations in Planar and Acyclic Graphs , 1986, SIAM J. Comput..

[30]  A. Satyanarayana,et al.  An O(|E|) Time Algorithm for Computing the Reliability of a Class of Directed Networks , 1984, Oper. Res..