Abstract
A graph G=(V, E) is recursive if every node of G has a finite number of neighbors, and both V and E are recursive (i.e., decidable). We examine the complexity of identifying the number of connected components of an infinite recursive graph, when no bound is given a priori. The Turing degree of the oracle required is already established in the literature. In this paper we analyze the number of queries required. We show that this problem is related to unbounded search in two ways:
-
1.
If f is a non-decreasing recursive function, and ∑i≥02−f(i) ≤ 1 is effectively computable, then the number of components of a recursive graph G e , nC(G e ), can be found with f(nC(G e )) queries to ø, and
-
2.
If G is an infinite recursive graph and there is a set X such that nC(G) can be computed using f(nC(G)) queries to X, then f satisfies Kraft's inequality.
Part (2) above can be interpreted as a lower bound to the number of queries to ø, which is shown to be optimal, even if free queries to weaker oracles are allowed.
Our main result is a generalization of a key theorem of Beigel and Gasarch's, which allows us to conclude that part (2) also applies to a wide class of problems, including the problems of finding the number of finite components and finding the number of infinite components of an infinite recursive graph.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
D. R. Bean, Effective Coloration, J. of Symbolic Logic, 1976, 41, pp. 469–480.
R. J. Beigel, Unbounded Searching Algorithms, SIAM J. Computing, 1990, vol. 19, no. 3, pp. 522–537.
R. J. Beigel and W. I. Gasarch, On the Complexity of Finding the Chromatic Number of a Recursive Graph I: The Bounded Case, Annals of Pure and Applied Logic, 1989, 45, pp. 1–38.
R. J. Beigel and W. I. Gasarch, On the Complexity of Finding the Chromatic Number of a Recursive Graph II: The Unbounded Case, Annals of Pure and Applied Logic, 1989, 45, pp. 227–246.
R. J. Beigel and W. I. Gasarch and J. T. Gill and J. Owings, Terse, Superterse, and Verbose Sets, Information and Computation, Vol. 103, pp. 68–85, 1993 (Also TR 1806, Dept. of Comp. Sc., U. of Maryland, USA, 1987.)
J. L. Bentley and A. C. C. Yao, An Almost Optimal Algorithm for Unbounded Searching, Information Processing Letters, August, 1976, 5, pp. 82–87.
R. G. Gallagher, Information Theory and Reliable Communication, 1968, John Wiley, New York.
W. I. Gasarch and K. S. Guimarães, On the Number of Components of a Recursive Graph, LNCS 583, Imre Simon (Ed.), 1992, pp. 177–190.
David Harel, Hamiltonian Paths in Infinite Graphs, Israel Journal of Mathematics, Vol. 76, pp. 317–336, 1991. (A shorter version appeared in STOC 1991, pp. 220–229.)
D. E. Knuth, Supernatural Numbers, in The Mathematical Gardner, D. A. Klarner, editor, 1981, pp. 310–325, Wadsworth International, publisher, Belmont, CA.
A. Manaster and J. Rosenstein, Effective Matchmaking and k-chromatic graphs, Proc. of the American Mathematical Society, 1973, 39, pp. 371–378.
H. Rogers Jr., Theory of Recursive Functions and Effective Computability, 1967, McGraw-Hill, New York.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gasarch, W.I., Guimarães, K.S. (1995). Unbounded search and recursive graph problems. In: Baeza-Yates, R., Goles, E., Poblete, P.V. (eds) LATIN '95: Theoretical Informatics. LATIN 1995. Lecture Notes in Computer Science, vol 911. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59175-3_99
Download citation
DOI: https://doi.org/10.1007/3-540-59175-3_99
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59175-7
Online ISBN: 978-3-540-49220-7
eBook Packages: Springer Book Archive