Abstract
Decision problems have traditionally been classified as either “tractable” or “intractable, ” depending on whether polynomial-time decision algorithms exist to solve them. Until recently, one could expect proofs of tractability to be constructive. This comfortable situation is altered, however, by the new and inherently nonconstructive developments in the theory of well-partially-ordered sets. In this paper, we survey some of the main results and open questions related to this topic.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
K. Abrahamson, M. R. Fellows, M. A. Langston and B. Moret, “Constructive Complexity,” Discrete Applied Mathematics, to appear.
H. H. Bodlaender, “Improved Self-Reduction Algorithms for Graphs with Bounded Treewidth,” to appear.
D. J. Brown, M. R. Fellows and M. A. Langsten, “Polynomial-Time Self-Reducibility: Theoretical Motivations and Practical Results,” Int'l J. of Computer Mathematics 31 (1989), 1–9.
M. R. Fellows and M. A. Langston, “Nonconstructive Advances in Polynomial-Time Complexity,” Information Processing Letters 26 (1987), 157–162.
-, “Nonconstructive Tools for Proving Polynomial-Time Decidability,” J. of the ACM 35 (1988), 727–739.
-“Layout Permutation Problems and Well-Partially-Ordered Sets,” Proc. 5th MIT Conf. on Advanced Research in VLSI (1988), 315–327.
-“On Search, Decision and the Efficiency of Polynomial-Time Algorithms,” Proc. 21st ACM Symp. on Theory of Computing (1989), 501–512.
-“An Analogue of the Myhill-Nerode Theorem and Its Use in Computing Finite-Basis Characterizations,” Proc. 30th IEEE Symposium on Foundations of Computer Science, (1989), 520–525.
H. Friedman, N. Robertson and P. D. Seymour, “The Metamathematics of the Graph Minor Theorem,” in Applications of Logic to Combinatorics, American Math. Soc., Providence, RI, to appear.
M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, CA, 1979.
A. Gupta, Ph.d. dissertation, University of Toronto, Department of Computer Science, 1991.
N. G. Kinnersley, “Obstruction Set Isolation for Layout Permutation Problems,” Ph.D. Thesis, Department of Computer Science, Washington State University, 1989.
C. Murthy, “Extracting Constructive Content from Classical Proofs,” Ph.D. Thesis, Department of Computer Science, Cornell University, 1990.
B. Reed, to appear. (Presented at the AMS Summer Workshop on Graph Minors, Seattle, June 1991.)
N. Robertson and P. D. Seymour, “Graph Minors IV. Tree-Width and Well-Quasi-Ordering,” J. Combinatorial Theory Series B, to appear.
-, “Graph Minors V. Excluding a Planar Graph,” J. Combinatorial Theory Series B 41 (1986), 92–114.
-“Graph Minors X. Obstructions to Tree-Decomposition,” to appear.
-“Graph Minors XIII. The Disjoint Paths Problem,” to appear.
-“Graph Minors XVI. Wagner's Conjecture,” to appear.
K. Winklmann, private communication.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fellows, M.R., Langston, M.A. (1992). Constructivity issues in graph algorithms. In: Myers, J.P., O'Donnell, M.J. (eds) Constructivity in Computer Science. Constructivity in CS 1991. Lecture Notes in Computer Science, vol 613. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0021088
Download citation
DOI: https://doi.org/10.1007/BFb0021088
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55631-2
Online ISBN: 978-3-540-47265-0
eBook Packages: Springer Book Archive