Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A survey

[1]  Robert E. Tarjan,et al.  Decomposition by clique separators , 1985, Discret. Math..

[2]  Charles J. Colbourn,et al.  Concurrent Transmissions in Broadcast Networks , 1984, ICALP.

[3]  Mihalis Yannakakis.  A Polynomial Algorithm for the Min Cut Linear Arrangement of Trees (Extended Abstract) , 1983, FOCS.

[4]  Charles J. Colbourn,et al.  Steiner trees, partial 2-trees, and minimum IFI networks , 1983, Networks.

[5]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[6]  Nobuji Saito,et al.  Linear-time computability of combinatorial problems on series-parallel graphs , 1982, JACM.

[7]  Arnon Rosenthal.  Dynamic Programming is Optimal for Nonserial Optimization Problems , 1982, SIAM J. Comput..

[8]  Arnon Rosenthal.  Series-parallel reduction for difficult measures of network reliability , 1981, Networks.

[9]  Derek G. Corneil,et al.  Complement reducible graphs , 1981, Discret. Appl. Math..

[10]  M. Yannakakis.  Computing the Minimum Fill-in is NP^Complete , 1981 .

[11]  Sue Whitesides,et al.  An Algorithm for Finding Clique Cut-Sets , 1981, Inf. Process. Lett..

[12]  G. Huet,et al.  Equations and rewrite rules: a survey , 1980 .

[13]  Bengt Ingemar Aspvall.  Efficient algorithms for certain satisfiability and linear programming problems , 1981 .

[14]  Eugene C. Freuder.  Synthesizing constraint expressions , 1978, CACM.

[15]  S. Arnborg.  Reduced State EnumerationߞAnother Algorithm for Reliability Evaluation , 1978, IEEE Transactions on Reliability.

[16]  David S. Johnson,et al.  COMPLEXITY RESULTS FOR BANDWIDTH MINIMIZATION , 1978 .

[17]  A. Rosenthal.  Computing the Reliability of Complex Networks , 1977 .

[18]  Donald J. ROSE,et al.  On simple characterizations of k-trees , 1974, Discret. Math..

[19]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[20]  David L. Waltz,et al.  Generating Semantic Descriptions From Drawings of Scenes With Shadows , 1972 .

[21]  Fanica Gavril,et al.  Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph , 1972, SIAM J. Comput..

[22]  Umberto Bertelè,et al.  Nonserial Dynamic Programming , 1972 .

[23]  R. E. Pippert,et al.  Properties and characterizations of k -trees , 1971 .

[24]  D. Rose.  Triangulated graphs and the elimination process , 1970 .

[25]  R. Bellman.  Dynamic programming. , 1957, Science.

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

[27]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.