Home › Entities › academia › Minimizing Node Expansions in Bidirectional Search with Consistent Heuristics

Minimizing Node Expansions in Bidirectional Search with Consistent Heuristics

Research article (Proceedings of the International Symposium on Combinatorial Search, 2021) · cited 18× · AI/ML
academia openalex:W2887308151
Press Enter · cited answer in seconds

Minimizing Node Expansions in Bidirectional Search with Consistent Heuristics

Summary

Minimizing Node Expansions in Bidirectional Search with Consistent Heuristics is a scholarly article[1].

Key Facts

  • Minimizing Node Expansions in Bidirectional Search with Consistent Heuristics's instance of is recorded as scholarly article[2].

Related Entities

Nathan Sturtevant

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [2] ↑ . wikidata.org.

Class ancestry

  1. [1] ↑ . Wikidata. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). Minimizing Node Expansions in Bidirectional Search with Consistent Heuristics. Retrieved May 24, 2026, from https://4ort.xyz/entity/minimizing-node-expansions-in-bidirectional-search-with-consistent-heuristics
MLA “Minimizing Node Expansions in Bidirectional Search with Consistent Heuristics.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/minimizing-node-expansions-in-bidirectional-search-with-consistent-heuristics.
BibTeX @misc{4ortxyz_minimizing-node-expansions-in-bidirectional-search-with-consistent-heuristics_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Minimizing Node Expansions in Bidirectional Search with Consistent Heuristics}}, year = {2026}, url = {https://4ort.xyz/entity/minimizing-node-expansions-in-bidirectional-search-with-consistent-heuristics}, note = {Accessed: 2026-05-24}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Minimizing Node Expansions in Bidirectional Search with Consistent Heuristics — https://4ort.xyz/entity/minimizing-node-expansions-in-bidirectional-search-with-consistent-heuristics (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/minimizing-node-expansions-in-bidirectional-search-with-consistent-heuristics · Last refreshed: