Unbounded search and recursive graph problems

DOI10.1007/3-540-59175-3_99zbMath1495.68173OpenAlexW1771707026MaRDI QIDQ5096341

William I. Gasarch, Katia S. Guimarães

Publication date: 16 August 2022

Published in: LATIN '95: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59175-3_99

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Applications of computability and recursion theory (03D80)

Cites Work

• Unnamed Item
• Unnamed Item
• On the complexity of finding the chromatic number of a recursive graph. II: The unbounded case
• Hamiltonian paths in infinite graphs
• An almost optimal algorithm for unbounded searching
• Terse, superterse, and verbose sets
• On the complexity of finding the chromatic number of a recursive graph. I: The bounded case
• Unbounded Searching Algorithms
• Effective coloration
• Effective Matchmaking and k-Chromatic Graphs

This page was built for publication: Unbounded search and recursive graph problems