Kombinatorická optimalizace: vzájemné vztahy mezi algoritmy na grafech

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F62690094%3A18450%2F08%3A00002295" target="_blank" >RIV/62690094:18450/08:00002295 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Combinatorial Optimization: Mutual Relations among Graph Algorithms

Popis výsledku v původním jazyce

The Theory of Graphs is a wonderful, practical discipline. Informatics has played a big part in its development, and these two fields are strongly interconnected. This can, perhaps, mainly be seen in the design of computer algorithms. On the one hand, there are many methods which can be used for solving the same problem, while on the other hand, using effective modifications of one algorithm, we can devise methods of solving various other tasks. To educate students in the area close connected with GraphTheory and Computer Science, called as Combinatorial or Discrete Optimization, it is important to make them familiar with certain algorithms in contexts to be able to get deeper into each problem and entirely understand it. In the paper we present justa few ideas that have proved successful in teaching and learning this quite young part of mathematics.

Název v anglickém jazyce

Combinatorial Optimization: Mutual Relations among Graph Algorithms

Popis výsledku anglicky

The Theory of Graphs is a wonderful, practical discipline. Informatics has played a big part in its development, and these two fields are strongly interconnected. This can, perhaps, mainly be seen in the design of computer algorithms. On the one hand, there are many methods which can be used for solving the same problem, while on the other hand, using effective modifications of one algorithm, we can devise methods of solving various other tasks. To educate students in the area close connected with GraphTheory and Computer Science, called as Combinatorial or Discrete Optimization, it is important to make them familiar with certain algorithms in contexts to be able to get deeper into each problem and entirely understand it. In the paper we present justa few ideas that have proved successful in teaching and learning this quite young part of mathematics.

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

Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2008

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

WSEAS transactions on mathematic

ISSN

1109-2769

e-ISSN

—

Svazek periodika

7

Číslo periodika v rámci svazku

5

Stát vydavatele periodika

GR - Řecká republika

Počet stran výsledku

11

Strana od-do

—

Kód UT WoS článku

—

EID výsledku v databázi Scopus

—