On Commutativity Based Edge Lean Search

DOI10.1007/978-3-540-73420-8_16MaRDI QIDQ5428806zbMATH OpenOpenAlexFDO

Authors Dragan Bošnački, Edith Elkind, Blaise Genest, Doron Peled

Publication date 28 November 2007

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73420-8_16

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Searching and sorting (68P10) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• On commutativity based edge lean search
• Heuristic Search for the Analysis of Graph Transition Systems
• Efficiently searching a graph by a smell-oriented vertex process
• On the Complexity of Commutativity Analysis
• Searching for an edge in a graph

Cited in

(2)

• Partial-Order Reduction
• On commutativity based edge lean search

This page was built for publication: On Commutativity Based Edge Lean Search

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