Unbounded search and recursive graph problems

DOI10.1007/3-540-59175-3_99MaRDI QIDQ5096341zbMATH OpenOpenAlexFDO

Authors William Gasarch, Katia 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

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

Recommendations

• Unbounded Searching Algorithms
• Search problems on graphs
• Binary search and recursive graph problems
• scientific article; zbMATH DE number 1953084
• scientific article; zbMATH DE number 15129
• scientific article; zbMATH DE number 4174651
• The complexity of searching a graph
• Discrete search programs on graphs
• Non-deterministic graph searching in trees

Cites work

• An almost optimal algorithm for unbounded searching
• Effective coloration
• Effective Matchmaking and k-Chromatic Graphs
• Hamiltonian paths in infinite graphs
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3316587 (Why is no real title available?)
• On the complexity of finding the chromatic number of a recursive graph. I: The bounded case
• On the complexity of finding the chromatic number of a recursive graph. II: The unbounded case
• Terse, superterse, and verbose sets
• Unbounded Searching Algorithms

Cited in

(5)

• Binary search and recursive graph problems
• On the complexity of finding the chromatic number of a recursive graph. I: The bounded case
• Finitely repeated search and the diamond paradox
• More Nearly Optimal Algorithms for Unbounded Searching, II:The Transfinite Case
• On the complexity of finding the chromatic number of a recursive graph. II: The unbounded case

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096341)