Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Perimeter search in restricted memory

From MaRDI portal
Publication:1352758
Jump to:navigation, search

DOI10.1016/0898-1221(96)00154-XzbMath0864.68022MaRDI QIDQ1352758

O. Diekmann

Publication date: 22 June 1997

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)


zbMATH Keywords

backward pruningperimeter search technique


Mathematics Subject Classification ID

Searching and sorting (68P10) Data structures (68P05)





Cites Work

  • Unnamed Item
  • Unnamed Item
  • Depth-first iterative-deepening: An optimal admissible tree search
  • \(BS^*:\) An admissible bidirectional staged heuristic search algorithm
  • Bidirectional heuristic search with limited resources
  • \(\text{BIDA}^*\): An improved perimeter search algorithm
  • Bidirectional Heuristic Search Again
  • An Improved Bidirectional Heuristic Search Algorithm




This page was built for publication: Perimeter search in restricted memory

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1352758&oldid=13489559"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 14:12.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki