MM: a bidirectional search algorithm that is guaranteed to meet in the middle (Q1677446): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.artint.2017.05.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2747118187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4886043 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bidirectional Heuristic Search Again / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimality theorem for a bi-directional heuristic search algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Bidirectional Heuristic Search Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inconsistent heuristics in theory and practice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2999215 / rank
 
Normal rank
Property / cites work
 
Property / cites work: MM: a bidirectional search algorithm that is guaranteed to meet in the middle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471869 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4386972 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Frontier search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5672218 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(BS^*:\) An admissible bidirectional staged heuristic search algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimally solving permutation sorting problems with efficient partial expansion bidirectional heuristic search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bidirectional shortest-path algorithm with good average-case behavior / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\text{BIDA}^*\): An improved perimeter search algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of admissible search algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel shortest path algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the Shortest Route between Two Points in a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3856120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Recent Results in Heuristic Search Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new bidirectional search algorithm with shortened postprocessing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on ``A new bidirectional algorithm for shortest paths'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5626306 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Diameter of the Rubik's Cube Group Is Twenty / rank
 
Normal rank

Revision as of 17:57, 14 July 2024

scientific article
Language Label Description Also known as
English
MM: a bidirectional search algorithm that is guaranteed to meet in the middle
scientific article

    Statements

    MM: a bidirectional search algorithm that is guaranteed to meet in the middle (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    21 November 2017
    0 references
    heuristic search
    0 references
    bidirectional search
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers