Breadth-First-Search Tree - Levels and Subtrees

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F62690094%3A18470%2F15%3A50003982" target="_blank" >RIV/62690094:18470/15:50003982 - isvavai.cz</a>

Result on the web

<a href="http://www.naun.org/cms.action?id=10207" target="_blank" >http://www.naun.org/cms.action?id=10207</a>

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Breadth-First-Search Tree - Levels and Subtrees

Original language description

The Breadth-First-Search algorithm belongs to the most used searching algorithms. The Breadth-First-Search tree has its special properties that can be convenient to be used in various other algorithms. Deep analysis of the topic and discussion on mutualrelationships between solutions to problems allows the teacher to enhance student's logical thinking and support their understanding to more complex algorithms. Moreover, contrary to the intuition that a problem is solvable by a polynomial algorithm, theoretical background of the appropriate topic can show that the problem is much more complex and a fast algorithm is unlikely to exist. The paper presents a comprehensive view on problems that are based on Breadth-First-Search tree property.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

BB - Applied statistics, operational research

OECD FORD branch

—

Project

—

Continuities

S - Specificky vyzkum na vysokych skolach

Publication year

2015

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

International journal of mathematics and computers in simulation

ISSN

1998-0159

e-ISSN

—

Volume of the periodical

9

Issue of the periodical within the volume

2015

Country of publishing house

US - UNITED STATES

Number of pages

7

Pages from-to

206-212

UT code for WoS article

—

EID of the result in the Scopus database

—