Graph properties checkable in linear time in the number of vertices

Journal of Computer and System Sciences

Volumn 68, Issue 3, 2004, Pages 546-597

  Grandjean, Etienne ^a   Olive, Frédéric ^b  

^a UNIVERSITÉ DE CAEN   (France)

^b AIX MARSEILLE UNIV   (France)

Author keywords

Combinatorial problems; Complexity lower bounds; Existential second order logic; Finite model theory; Linear time; Nondeterminism

Indexed keywords

BOUNDARY VALUE PROBLEMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; GRAPH THEORY; HAMILTONIANS; PROBLEM SOLVING; THEOREM PROVING;

COMBINATORIAL PROBLEMS; COMPLEXITY LOWER BOUNDS; EXISTENTIAL SECOND-ORDER LOGIC; FINITE MODEL THEORY; LINEAR TIME; NONDETERMINISM;

LINEAR SYSTEMS;

EID: 2342622654     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jcss.2003.09.002     Document Type: Article

References (50)

1. A.V. Aho, J. Hopcroft, J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
2. P. Beame, A general sequential time-space tradeoff for finding unique elements, SIAM J. Comput. 20 (2) (1991) 270-277.
3. A. Ben-Amram, N. Jones, Computational complexity via programming languages: constant factors do matter, Acta Inform. 37 (2000) 83-120.
4. N. Blum, A new approach to maximum matching in general graphs, in: W.R. Cleaveland (Ed.), ICALP, Lecture Notes in Computer Sciences, Vol. 443, Springer-Verlag, Warwick, England, 1990, pp. 586-597.
5. G. Bonfante, Personal communication, 2001.
6. A. Borodin, S. Cook, A time-space tradeoff for sorting on a general sequential model of computation, SIAM J. Comput. 11 (2) (1982) 287-297.
7. G. Chartrand, L. Lesniak, Graphs and Digraphs, Wadsworth and Brooks, California, 1986.
8. S.A. Cook, A hierarchy of nondeterministic time complexity, J. Comput. System Sci. 7 (1973) 343-353.
9. T. Cormen, C. Leiserson, R. Rivest, Introduction to Algorithms, McGraw-Hill, New York, 1991.
10. N. Creignou, Temps Linéaire et Problèmes NP-Complets, Ph.D. Thesis, Université de Caen, France, 1993.
11. H.-D. Ebbinghaus, J. Flum, Finite Model Theory, Springer, Berlin, 1995.
12. R. Fagin, Generalized first-order spectra and polynomial-time recognizable sets, in: R.M. Karp (Ed.), Complexity of Computation, SIAM-AMS Proceedings, 1974, pp. 43-73.
13. R. Fagin, A spectrum hierarchy, Z. Math. Logik Grundlagen Math. 21 (1975) 123-134.
14. L. Fortnow, Time-space tradeoffs for satisfiability, J. Comput. System Sci. 60 (2) (2000) 337-353.
15. M.R. Garey, D.S. Johnson, Computers and Intractability - A Guide to the Theory of NP-Completeness, Freeman, New York, 1979.
16. E. Grädel, On the notion of linear time computability, Internat. J. Foundations Comput. Sci. 1 (1990) 295-307.
17. E. Grandjean, The spectra of first-order sentences and computational complexity, SIAM J. Comput. 13 (2) (May 1984) 356-373.
18. E. Grandjean, Universal quantifiers and time complexity of random access machines, Math. System Theory 13 (1985) 171-187.
19. E. Grandjean, First-order spectra with one variable, J. Comput. System Sci. 40 (1990) 136-153.
20. E. Grandjean, A nontrivial lower bound for an NP problem on automata, SIAM J. Comput. 19 (1990) 438-451.
21. E. Grandjean, Invariance properties of RAMs and linear time, Comput. Complexity 4 (1994) 62-106.
22. E. Grandjean, Linear time algorithms and NP-complete problems, SIAM J. Comput. 23 (1994) 573-597.
23. E. Grandjean, Sorting, linear time and the satisfiability problem, Ann. Math. Artificial Intelligence 16 (1996) 183-236.
24. E. Grandjean, F. Olive, Monadic logical definability of nondeterministic linear time, Comput. Complexity 7 (1998) 54-97.
25. E. Grandjean, T. Schwentick, Machine-independent characterizations and complete problems for deterministic linear time, SIAM J. Comput. 32 (1) (2002) 196-230.
26. Y. Gurevich, S. Shelah, Nearly linear time, Lecture Notes in Computer Science, Vol. 363, 1989, pp. 108-118.
27. Y. Gurevich, S. Shelah, Nondeterministic linear-time tasks may require substantially nonlinear deterministic time in the case of sublinear work space, J. ACM 37 (3) (1990) 674-687.
28. P. Hájek, P. Pudlak, Metamathematics of First-Order Arithmetic, Springer, Berlin, 1993.
29. N. Immerman, Languages that capture complexity classes, SIAM J. Comput. 16 (August 1987) 760-778.
30. N. Immerman, Descriptive Complexity, Graduate Texts in Computer Science, Springer, Berlin, 1999.
31. R.M. Karp, Reducibility among combinatorial problems, in: Complexity of Computers Computations, IBM Symposium 1972, Plenum Press, New York, 1972.
32. C. Lautemann, Personal communication, 1999.
33. C. Lautemann, Personal communication, 2001.
34. J.F. Lynch, Complexity classes and theory of finite models, Math. System Theory 15 (1982) 127-144.
35. S. Micali, V. Vazirani, An O(√|V|) algorithm for finding maximum matching in general graphs, in: FOCS, 1980, pp. 17-27.
36. F. Olive, Caractérisations logiques des problèmes NP: robustesse et normalisation, Ph.D. Thesis, Université de Caen, France, 1996.
37. F. Olive, A conjunctive logical characterization of non-deterministic linear time, in: Proceedings of the 11th Annual Conference of the EACSL (CSL'97), Lecture Notes in Computer Science, Vol. 1414, 1998, pp. 360-372.
38. C.H. Papadimitriou, Computational Complexity, Addison-Wesley, Reading, MA, 1994.
39. C.H. Papadimitriou, K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliff, NJ, 1982.
40. W.J. Paul, N. Pippenger, E. Szemeredi, W.T. Trotter, On determinism versus non determinism and related problems (preliminary version), In 24th Annual Symposium on Foundations of Computer Science, IEEE, New York, 1983, pp. 429-438.
41. S. Ranaivoson, Nontrivial lower bounds for some NP-complete problems on directed graphs, in: Lecture Notes on Computer Science, Vol. 533, CSL'90, 1991, pp. 318-339.
42. S. Ranaivoson, Personal communication, 1999.
43. S. Ranaivoson, Personal communication, 2000.
44. K. Regan, Machine models and linear time complexity, in: SIGACT News, Vol. 24, Fall 1993.
45. T. Schwentick, Algebraic and logical characterizations of deterministic linear time classes, in: Proceedings of the 12th Symposium on Theoretical Aspects of Computer Science (STACS'97), 1997, pp. 463-474.
46. I.A. Stewart, Logical descriptions of monotone NP problems, J. Logic Comput. 4 (1994) 337-357.
47. I.A. Stewart, On completeness for NP via projection translations, Math. System Theory 27 (1994) 125-157.
48. I.A. Stewart, Complete problems for monotone NP, Theoret. Comput. Sci. 145 (1995) 147-157.
49. L.J. Stockmeyer, The polynomial-time hierarchy, Theoret. Comput. Sci. 3 (1977) 1-22.
50. V. Vazirani, A theory of alternating paths and blossoms for proving correctness of the O(√|V||E|) general graph maximum matching algorithm, Combinatorica 14 (1) (1994) 71-109.