Dynamic programming as optimal path problem in weighted digraphs.

Kátai, Zoltán

Acta Mathematica Academiae Paedagogicae Nyí regyháziensis. New Series [electronic only] (2008)

  • Volume: 24, Issue: 2, page 201-208
  • ISSN: 1786-0091

How to cite

top

Kátai, Zoltán. "Dynamic programming as optimal path problem in weighted digraphs.." Acta Mathematica Academiae Paedagogicae Nyí regyháziensis. New Series [electronic only] 24.2 (2008): 201-208. <http://eudml.org/doc/55747>.

@article{Kátai2008,
author = {Kátai, Zoltán},
journal = {Acta Mathematica Academiae Paedagogicae Nyí regyháziensis. New Series [electronic only]},
keywords = {dynamic programming; graph theory; optimal path algorithms},
language = {eng},
number = {2},
pages = {201-208},
publisher = {Bessenyei György College, Department of Mathematics},
title = {Dynamic programming as optimal path problem in weighted digraphs.},
url = {http://eudml.org/doc/55747},
volume = {24},
year = {2008},
}

TY - JOUR
AU - Kátai, Zoltán
TI - Dynamic programming as optimal path problem in weighted digraphs.
JO - Acta Mathematica Academiae Paedagogicae Nyí regyháziensis. New Series [electronic only]
PY - 2008
PB - Bessenyei György College, Department of Mathematics
VL - 24
IS - 2
SP - 201
EP - 208
LA - eng
KW - dynamic programming; graph theory; optimal path algorithms
UR - http://eudml.org/doc/55747
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.