Comparison of the Efficiency of Two Algorithms Which Solve the Shortest Path Problem With an Emotional Agent

Silvana Petruseva

The Yugoslav Journal of Operations Research (2006)

  • Volume: 16, Issue: 32, page 211-226
  • ISSN: 0354-0243

How to cite

top

Silvana Petruseva. "Comparison of the Efficiency of Two Algorithms Which Solve the Shortest Path Problem With an Emotional Agent." The Yugoslav Journal of Operations Research 16.32 (2006): 211-226. <http://eudml.org/doc/261757>.

@article{SilvanaPetruseva2006,
author = {Silvana Petruseva},
journal = {The Yugoslav Journal of Operations Research},
keywords = {complexity; polynomial time; exponential time; adjacency matrix},
language = {eng},
number = {32},
pages = {211-226},
publisher = {Faculty of Organizational Sciences},
title = {Comparison of the Efficiency of Two Algorithms Which Solve the Shortest Path Problem With an Emotional Agent},
url = {http://eudml.org/doc/261757},
volume = {16},
year = {2006},
}

TY - JOUR
AU - Silvana Petruseva
TI - Comparison of the Efficiency of Two Algorithms Which Solve the Shortest Path Problem With an Emotional Agent
JO - The Yugoslav Journal of Operations Research
PY - 2006
PB - Faculty of Organizational Sciences
VL - 16
IS - 32
SP - 211
EP - 226
LA - eng
KW - complexity; polynomial time; exponential time; adjacency matrix
UR - http://eudml.org/doc/261757
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.