A Note on Two Problems in Connexion with Graphs.
Numerische Mathematik (1959)
- Volume: 1, page 269-271
- ISSN: 0029-599X; 0945-3245/e
Access Full Article
top
How to cite
topDIJKSTRA, E.W.. "A Note on Two Problems in Connexion with Graphs.." Numerische Mathematik 1 (1959): 269-271. <http://eudml.org/doc/131436>.
@article{DIJKSTRA1959,
author = {DIJKSTRA, E.W.},
journal = {Numerische Mathematik},
keywords = {topology},
pages = {269-271},
title = {A Note on Two Problems in Connexion with Graphs.},
url = {http://eudml.org/doc/131436},
volume = {1},
year = {1959},
}
TY - JOUR
AU - DIJKSTRA, E.W.
TI - A Note on Two Problems in Connexion with Graphs.
JO - Numerische Mathematik
PY - 1959
VL - 1
SP - 269
EP - 271
KW - topology
UR - http://eudml.org/doc/131436
ER -
Citations in EuDML Documents
top- Jacques Desrosiers, Paul Pelletier, François Soumis, Plus court chemin avec contraintes d'horaires
- F. Bendali, A. Quilliot, Réseaux stochastiques
- Irène Paumelle, Un indicateur informatique d'itinéraire pour les réseaux d'autobus
- Y. P. Aneja, K. P. K. Nair, Two problems in multicommodity networks
- Teodros Getachew, Michael Kostreva, Laura Lancaster, A generalization of dynamic programming for Pareto optimization in dynamic networks
- T. Brian Boffey, R. C. Williams, B. Pelegrín, P. Fernandez, The maximum capacity shortest path problem : generation of efficient solution sets
- Ladislav Janiga, Václav Koubek, Minimum cut in directed planar networks
- Hadda Cherroun, Alain Darte, Paul Feautrier, Reservation table scheduling: branch-and-bound based optimization . integer linear programming techniques
- T. Brian Boffey, R. C. Williams, B. Pelegrín, P. Fernandez, The Maximum Capacity Shortest Path Problem: Generation of Efficient Solution Sets
- Gianfranco d'Atri, Improved lower bounds to the travelling salesman problem
NotesEmbed ?
topYou 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.