Algorithms solving path systems
Part of the Lecture Notes in Computer Science book series (LNCS, volume 199)
Al gorithms recognizing solvable path systems are presented and their time complexity is investigated. Among them there is an algorithm with a constant expected behaviour.
Unable to display preview. Download preview PDF.
- 1.A.V. Aho, J.E. Hopcroft, and J.D. Ullman, "The design and analysis of computer algorithms", Addison-Wesley, Reading, MA, 1976.Google Scholar
- 2.S.A. Cook, An observation on time — storage trade off, J. Comput. Syst. Sci. 9 (1974) 308–316.Google Scholar
- 3.S.A. Cook, Path systems and language recognition, Proc. 2-nd Ann. ACM Symposium on the Theory of Computation, 1970, 70–72.Google Scholar
- 4.P. Erdös, and J. Spencer, "Probabilistic methods in combinatorics", Akademiai Kiado, Budapest, 1974.Google Scholar
- 5.E.M. Gurari, and O.H. Ibarra, Path systems: constructions, solutions and applications, SIAM J. Comput. 9 (1980) 348–374.Google Scholar
- 6.N.O. Jones, and W.T. Laasser, Complete problems for deterministic time, Theoret. Comput. Sci. 3 (1976) 105–117.Google Scholar
- 7.W. Rytter, The complexity of unambigous path systems, Information Processing Letters 15 (1982) 102–104.Google Scholar
© Springer-Verlag Berlin Heidelberg 1985