Translator Disclaimer
June 2010 Some natural decision problems in automatic graphs
Dietrich Kuske, Markus Lohrey
J. Symbolic Logic 75(2): 678-710 (June 2010). DOI: 10.2178/jsl/1268917499

Abstract

For automatic and recursive graphs, we investigate the following problems:

  • (A) existence of a Hamiltonian path and existence of an infinite path in a tree

  • (B) existence of an Euler path, bounding the number of ends, and bounding the number of infinite branches in a tree

  • (C) existence of an infinite clique and an infinite version of set cover

The complexity of these problems is determined for automatic graphs and, supplementing results from the literature, for recursive graphs. Our results show that these problems
  • (A) are equally complex for automatic and for recursive graphs (Σ11-complete),

  • (B) are moderately less complex for automatic than for recursive graphs (complete for different levels of the arithmetic hierarchy),

  • (C) are much simpler for automatic than for recursive graphs (decidable and Σ11-complete, resp.).

Citation

Download Citation

Dietrich Kuske. Markus Lohrey. "Some natural decision problems in automatic graphs." J. Symbolic Logic 75 (2) 678 - 710, June 2010. https://doi.org/10.2178/jsl/1268917499

Information

Published: June 2010
First available in Project Euclid: 18 March 2010

zbMATH: 1192.03010
MathSciNet: MR2648160
Digital Object Identifier: 10.2178/jsl/1268917499

Rights: Copyright © 2010 Association for Symbolic Logic

JOURNAL ARTICLE
33 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.75 • No. 2 • June 2010
Back to Top