The linkage of a graph

SIAM Journal on Computing

Volumn 25, Issue 3, 1996, Pages 626-647

  Kirousis, Lefteris M ^a,b   Thilikos, Dimitris M ^a,b  

^a UNIVERSITY OF PATRAS   (Greece)

^b University of Patras and Computer Technology Institute   (Greece)

Author keywords

Algorithms in NC; Backtrack free search; Extremal graph properties; Linkage of a graph; P complete problems; Width parameters of a graph

Indexed keywords

EID: 0043158627     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539793255709     Document Type: Article

References (21)

1. R. ANDERSON AND E. MAYR, Parallelism and greedy algorithms, Adv. Comput. Res., 4 (1987) pp. 17-38; see also A P-complete problem and approximations to it, Tech. Report, Department of Computer Science, Stanford University, Stanford, CA, 1984.
2. R. ANDERSON AND E. MAYR, Parallelism and greedy algorithms, Adv. Comput. Res., 4 (1987) pp. 17-38; see also A P-complete problem and approximations to it, Tech. Report, Department of Computer Science, Stanford University, Stanford, CA, 1984.
3. S. ARNBORG, Efficient algorithms for combinatorial problems on graphs with bounded decomposability: A survey, BIT, 25 (1985), pp. 2-33.
4. H. L. BODLAENDER, Classes of graphs with bounded treewidth, Tech. Report RUU-CS-86-22, Department of Computer Science, Utrecht University, Utrecht, The Netherlands, 1986.
5. _, A tourist guide through treewidth, Acta Cybernet. 11 (1993), pp. 1-23.
6. R. DECHTER, Directional resolution: The Davis-Putnam procedure, revised, working notes, AAAI Spring Symposioum on AI and NP-Hard Problems, Stanford University, Stanford, CA, 1993, pp. 29-35.
7. P. ERDÖS, On the structure of linear graphs, Israel J. Math., 1 (1963), pp. 156-160.
8. E. C. FREUDER, A sufficient condition for backtrack-free search, J. Assoc. Comput. Mach., 29 (1982), pp. 24-32.
9. _, A sufficient condition for backtrack-bounded search, J. Assoc. Comput. Mach., 32 (1985), pp. 755-761.
10. L. KIROUSIS, M. SERNA, AND P. SPIRAKIS, The parallel complexity of the subgraph connectivity problem, SIAM J. Comput., 22 (1993), pp. 573-586.
11. J. VAN LEEUWEN, Graph algorithms, in Handbook of Theoretical Computer Science, J. van Leeuwen, ed., Elsevier, New York, 1990, pp. 525-631.
12. D. R. LICK AND A. T. WHITE, k-Degenerate graphs, Canad. J. Math., 22 (1970), pp. 1082-1096.
13. D. W. MATULA, A min-max theorem for graphs with application to graph coloring, SIAM Review, 10 (1968), pp. 481-182.
14. A. MACKWORTH, Constraint satisfaction, in Encyclopedia of Artificial Inteligence, S. C. Shapiro, ed., John Wiley, New York, 1992, pp. 276-285.
15. D. W. MATULA, G. MARBLE, AND J. D. ISAACSON, Graph coloring algorithms, in Graph Theory and Computing, Academic Press, New York, 1972, pp. 109-122.
16. Z. MILLER, Graph Layouts, in Applications of Discrete Mathematics, J. G. Michaels and K. H. Rozen, eds., McGraw-Hill, New York, 1991, pp. 365-393.
17. S. RAMACHANDRAMURTHI, A lower bound for treewidth and its consequences, in Proc. 20th International Workshop on Graph-Theoretic Concepts in Computer Science, Springer-Verlag, Berlin, New York, Heidelberg, 1994, pp. 14-25.
18. J. B. SAXE, Dynamic programming algorithms for recognizing small-bandwidth graphs in polynomial time, SIAM J. Algebraic Discrete Meth., 1 (1980), pp. 363-369.
19. M. SERNA AND P. SPIRAKIS, The approximability of problems complete for P, in Proc. International Symposium on Optimal Algorithms, Springer-Verlag, Berlin, New York, Heidelberg, 1989, pp. 193-204.
20. G. SZEKERES AND H. S. WILF, An inequality for the chromatic number of a graph, J. Combin. Theory, 4 (1968), pp. 1-3.
21. X. YAN, A relative approximation algorithm for computing the pathwidth, Master's thesis, Department of Computer Science, Washington State University, Pullman, WA, 1989.