Theory and techniques for synthesizing efficient breadth-first search algorithms

DOI10.1007/978-3-642-32759-9_27MaRDI QIDQ4647853zbMATH OpenOpenAlexFDO

Authors Srinivas Nedunuri, Douglas R. Smith, William R. Cook

Publication date 8 November 2012

Published in FM 2012: Formal Methods (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/2152/ETD-UT-2012-08-6242

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Breadth-first heuristic search
• scientific article; zbMATH DE number 5734730
• Parallel breadth-first search algorithms for trees and graphs
• Extended breadth-first search algorithm in practice
• scientific article; zbMATH DE number 1947435

Cited in

(6)

• Semi-dynamic breadth-first search in digraphs
• Certification of breadth-first algorithms by extraction
• Fast breadth-first search in still less space
• Breadth-first numbering
• scientific article; zbMATH DE number 5734730 (Why is no real title available?)
• Extended breadth-first search algorithm in practice

Describes a project that uses

Uses Software

• Dafny

This page was built for publication: Theory and techniques for synthesizing efficient breadth-first search algorithms

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