2006Journal of Shandong Institute of Light IndustryRequires access

An improved research on non-information graph-search algorithm

Geng Ru-nian, XU Wen-bo

Open publisher page 0 citations

Abstract

This paper studied and discussed the disadvantages of depth-first search algorithm and breadth-first search algorithm.An improved algorithm on Non-information graph-search was brought forward and the relevant exarnples to illustrate were given in this paper.

About this research paper

What this paper is about

This paper studied and discussed the disadvantages of depth-first search algorithm and breadth-first search algorithm.An improved algorithm on Non-information graph-search was brought forward and the relevant exarnples to illustrate were given in this paper.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

This paper studied and discussed the disadvantages of depth-first search algorithm and breadth-first search algorithm.An improved algorithm on Non-information graph-search was brought forward and the relevant exarnples to illustrate were given in this paper.

Key concepts: Best-first search, Search algorithm, Beam stack search, Computer science, Graph, Depth-first search, Algorithm, Breadth-first search

Related papers

Back to paper searchBrowse research topicsOriginal source
An improved research on non-information graph-search algorithm — Research Paper | ScholarLens