Heuristic Search for the Analysis of Graph Transition Systems

DOI10.1007/11841883_29MaRDI QIDQ3541978zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Stefan Edelkamp, Shahid Jabbar, Alberto Lluch Lafuente

Publication date 27 November 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://eprints.imtlucca.it/157/1/edelkamp_jabbar_lluch-lafuente2006a.pdf

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Heuristic search and related boundary value problems
• The complexity of searching implicit graphs
• Three approaches to heuristic search in networks
• The complexity of searching succinctly represented graphs
• Heuristic search. Theory and applications

Cited in

(7)

• On commutativity based edge lean search
• Hierarchical multiobjective shortest path problems
• Survey on Directed Model Checking
• AND/OR graph heuristic search methods
• scientific article; zbMATH DE number 2080054 (Why is no real title available?)
• Directed and optimizing search methods in complex data structures.
• On Commutativity Based Edge Lean Search

Describes a project that uses

Uses Software

• GROOVE
• BLAST

This page was built for publication: Heuristic Search for the Analysis of Graph Transition Systems

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