Breadth-First-Search Tree - Levels and Subtrees

Kód výsledku v 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>

Výsledek na webu

<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

—

Jazyk výsledku

angličtina

Název v původním jazyce

Breadth-First-Search Tree - Levels and Subtrees

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Breadth-First-Search Tree - Levels and Subtrees

Popis výsledku anglicky

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.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

BB - Aplikovaná statistika, operační výzkum

OECD FORD obor

—

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2015

Kód důvěrnosti údajů

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

Název periodika

International journal of mathematics and computers in simulation

ISSN

1998-0159

e-ISSN

—

Svazek periodika

9

Číslo periodika v rámci svazku

2015

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

7

Strana od-do

206-212

Kód UT WoS článku

—

EID výsledku v databázi Scopus

—