Multi-core nested depth-first search
DOI10.1007/978-3-642-24372-1_23zbMATH Open1348.68142DBLPconf/atva/LaarmanLPWW11OpenAlexW2119646872WikidataQ62047467 ScholiaQ62047467MaRDI QIDQ3172923FDOQ3172923
Authors:
Publication date: 7 October 2011
Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-24372-1_23
Recommendations
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Specification and verification (program logics, model checking, etc.) (68Q60) Parallel algorithms in computer science (68W10)
Cited In (7)
- BFS-based model checking of linear-time properties with an application on GPUs
- Automated verification of parallel nested DFS
- Automated verification of the parallel Bellman-Ford algorithm
- Title not available (Why is that?)
- Parallel nested depth-first searches for LTL model checking
- Improved multi-core nested depth-first search
- Finding strongly connected components of simple digraphs based on granulation strategy
Uses Software
This page was built for publication: Multi-core nested depth-first search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3172923)