This is a preview of subscription content, log in via an institution to check access.
References
A. V. Aho, J. E. Hopcroft and J. D. Ullman,Design and Analysis of Computer Algorithms, Reading, Mass. Addison-Wesley, 1974.
S. Arnborg,Reduced state enumeration — another algorithm for reliability evaluation, IEEE Trans. Reliability R-27 (1978), 101–105.
S. Arnborg,On the complexity of multivariable query evaluation, FOA Rapport C 20292-D8, National Defence Research Institute, Stockholm, Sweden (1979).
S. Arnborg, D. G. Corneil and A. Proskurowski,Complexity of finding embeddings in a k-tree, TRITA-NA 8407, Royal Institute of Technology, Sweden (1984).
S. Arnborg and A. Proskurowski,Characterization and recognition of partial k-trees, TRITA-NA 8402, Royal Institute of Technology, Sweden (1984).
S. Arnborg and A. Proskurowski,Linear time algorithms for NP-hard problems on graphs embedded in k-trees, TRITA-NA-8404, The Royal Institute of Technology (1984).
B. Aspvall,Efficient algorithms for certain satisfiability and linear programming problems, PhD Thesis, STAN-CS-80-822, Stanford University, 1980.
L. W. Beineke and R. E. Pippert,Properties and characterizations of k-trees, Mathematika 18 (1971), 141–151.
U. Bertele and F. Brioschi,Nonserial Dynamic Programming, Academic Press, New York, 1972.
C. J. Colbourn and A. Proskurowski,Concurrent transmissions in broadcast networks, in Proc. 11th Int'l Coll. on Automata, Languages, and Programming, Antwerp, Springer Verlag, Berlin (1984), 128–136.
D. G. Cornell and J. M. Keil,A dynamic programming approach to the dominating set problem on k-trees, Dept. of Computer Science, University of Toronto, Technical report (1983).
D. G. Corneil, H. Lerchs and L. Stewart Burlingham,Complement reducible graphs, Discrete Appl. Math. 3 (1981), 163–174.
M. Davis and H. Putnam,A computing procedure for quantification theory, J. ACM 7 (1960), 201–215.
R. J. Duffin,Topology of series-parallel networks, J. Math. Anal. Appl. 10 (1965), 303–318.
E. C. Freuder,Synthesizing constraint expressions, C. ACM 21 (1978), 958–966.
M. R. Garey, R. L. Graham, D. S. Johnson and D. E. Knuth,Complexity results for bandwidth minimization, SIAM J. Appl. Math. 34 (1978), 835–859.
M. R. Garey and D. S. Johnson,Computers and Intractability, W. H. Freeman and Company, San Francisco (1979).
F. Gavril,Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of chordal graph, SIAM J. Comput. 1 (1972), 180–187.
G. Huet and D. Oppen,Equations and rewrite rules: a survey, in Formal Languages: Perspective and Open Problems (R. Book, Ed.), Academic Press, New York, 1980.
D. S. Johnson,The NP-Completeness column: an ongoing guide, J. of Algorithms 1–4 (1981–4).
S. Kirkpatrick, C.D. Gelatt, Jr. and M. P. Vecchi,Optimization by simulated annealing, SCIENCE 220 (1983), 671–680.
D. Rose,Triangulated graphs and the elimination process, J. Math. Anal. Appl. 32, (1970), 597–609.
D. Rose,On simple characterizations of k-trees, Discrete Math. 7 (1974), 317–322.
A. Rosenthal,Computing the reliability of a complex network, SIAM J. Appl. Math. 32 (1977) 384–393.
A. Rosenthal,Dynamic programming is optimal for nonserial optimization problems, SIAM J. Comput. 11 (1982), 47–59.
A. Rosenthal,Series-parallel reduction for difficult measures of network reliability, NETWORKS 11 (1981), 323–334.
K. Takamizawa, T. Nishizeki and N. Saito,Linear-time computability of combinatorial problems on series-parallel graphs, J. ACM 29 (1982), 623–641.
R. E. Tarjan,Decomposition by clique separators, Discrete Math., to appear.
J. A. Wald and C. J. Colbourn,Steiner trees, partial 2-trees, and minimum IFI networks, Networks 13 (1983), 159–167.
D. L. Walz,Generating semantic descriptions from drawings of scenes with shadows. AI-TR-271, A.I. Lab, M.I.T., Cambridge, Mass., 1972.
S. H. Whitesides,An algorithm for finding clique cutsets, Inf. Proc. Letters 12 (1981), 31–32.
M. Yannakakis,Computing the minimum fill-in is NP-complete, SIAM J. Alg. and Discr. Methods 2 (1981), 77–79.
M. Yannakakis,A polynomial algorithm for the MIN CUT LINEAR ARRANGEMENT of Trees, Proc. 24th Annual Symp. on Foundations of Computer Science, IEEE, 1983, 274–281.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Arnborg, S. Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A survey. BIT 25, 1–23 (1985). https://doi.org/10.1007/BF01934985
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01934985