Optimally solving permutation sorting problems with efficient partial expansion bidirectional heuristic search
From MaRDI portal
Publication:4589262
DOI10.3233/AIC-160704zbMath1373.68204WikidataQ62695759 ScholiaQ62695759MaRDI QIDQ4589262
Ariel Felner, Marco Lippi, Marco Ernandes
Publication date: 10 November 2017
Published in: AI Communications (Search for Journal in Brave)
Searching and sorting (68P10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (3)
MM: a bidirectional search algorithm that is guaranteed to meet in the middle ⋮ Sorting with forbidden intermediates ⋮ Optimal path discovery problem with homogeneous knowledge
This page was built for publication: Optimally solving permutation sorting problems with efficient partial expansion bidirectional heuristic search
