Algorithm 97: Shortest path

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback
Take a look at the new version of this page: [ beta version ]. Tell us what you think.

Algorithm 97: Shortest path

Full text

Pdf (582 KB)

Source

Communications of the ACM archive
Volume 5 , Issue 6 (June 1962) table of contents

Page: 345

Year of Publication: 1962

ISSN:0001-0782

Author

Robert W. Floyd

Armour Research Foundation, Chicago, IL

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 39, Downloads (12 Months): 396, Citation Count: 140

Additional Information:

cited by collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/367766.368168 What is a DOI?

CITED BY 142

	Håkan Jakobsson, On tree-based techniques for query evaluation, Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.380-392, June 02-05, 1992, San Diego, California, United States
	Juan-Antonio Fernández-Madrigal , Javier González, Multihierarchical Graph Search, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.24 n.1, p.103-113, January 2002
	G. N. Frederickson, A new approach to all pairs shortest paths in planar graphs, Proceedings of the nineteenth annual ACM conference on Theory of computing, p.19-28, January 1987, New York, New York, United States
	Jose A. Blakeley , Per-Ake Larson , Frank Wm Tompa, Efficiently updating materialized views, ACM SIGMOD Record, v.15 n.2, p.61-71, June 1986
	Dennis Shasha , Tsong-Li Wang, New techniques for best-match retrieval, ACM Transactions on Information Systems (TOIS), v.8 n.2, p.140-158, Apr. 1990
	Rodolfo A. Pazos, A heuristic method for optimizing an intercity data transmission network, ACM SIGCOMM Computer Communication Review, v.11 n.4, p.90-97, October 1981
	Dinesh C. Verma , P. M. Gopal, Routing reserved bandwith multi-point connections, ACM SIGCOMM Computer Communication Review, v.23 n.4, p.96-105, Oct. 1993
	Robert Endre Tarjan, Fast Algorithms for Solving Path Problems, Journal of the ACM (JACM), v.28 n.3, p.594-614, July 1981
	Ambrose K. Laing , Robert Cypher, Deadlock-free routing in arbitrary networks via the flattest common supersequence method, Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures, p.55-66, June 28-July 02, 1998, Puerto Vallarta, Mexico
	Edward Minieka, On computing sets of shortest paths in a graph, Communications of the ACM, v.17 n.6, p.351-353, June 1974
	Peter Bloniarz, A shortest-path algorithm with expected time O(n2 log n log* n), Proceedings of the twelfth annual ACM symposium on Theory of computing, p.378-384, April 28-30, 1980, Los Angeles, California, United States
	F. Frances Yao, Efficient dynamic programming using quadrangle inequalities, Proceedings of the twelfth annual ACM symposium on Theory of computing, p.429-435, April 28-30, 1980, Los Angeles, California, United States
	Robert A. Wagner, Order-n correction for regular languages, Communications of the ACM, v.17 n.5, p.265-268, May 1974
	Lin Yu , Daniel J. Rosenkrantz, Minimizing time-space cost for database version control, Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.294-301, March 1988, Austin, Texas, United States
	Frank Mueller , David B. Whalley, Avoiding unconditional jumps by code replication, ACM SIGPLAN Notices, v.27 n.7, p.322-330, July 1992
	Greg N. Frederickson, Approximation Algorithms for Some Postman Problems, Journal of the ACM (JACM), v.26 n.3, p.538-554, july 1979
	M. Lam, Software pipelining: an effective scheduling technique for VLIW machines, ACM SIGPLAN Notices, v.23 n.7, p.318-328, July 1988
	Rodrigo A. Botafogo , Ehud Rivlin , Ben Shneiderman, Structural analysis of hypertexts: identifying hierarchies and useful metrics, ACM Transactions on Information Systems (TOIS), v.10 n.2, p.142-180, April 1992
	Guy Lapalme , Jean-Marc Rousseau , Suzanne Chapleau , Michel Cormier , Pierre Cossette , Serge Roy, Georoute: a geographic information system for transportation applications, Communications of the ACM, v.35 n.1, p.80-88, Jan. 1992
	Donald B. Johnson , Samuel D. Kashdan, Lower Bounds for Selection in X + Y and Other Multisets, Journal of the ACM (JACM), v.25 n.4, p.556-570, Oct. 1978
	Suzanne W. Dietrich, Shortest path by approximation in logic programs, ACM Letters on Programming Languages and Systems (LOPLAS), v.1 n.2, p.119-137, June 1992
	Greg N. Frederickson, Planar graph decomposition and all pairs shortest paths, Journal of the ACM (JACM), v.38 n.1, p.162-204, Jan. 1991
	Donald B. Johnson, Efficient Algorithms for Shortest Paths in Sparse Networks, Journal of the ACM (JACM), v.24 n.1, p.1-13, Jan. 1977
	José A. Blakeley , Neil Coburn , Per-:1Vke Larson, Updating derived relations: detecting irrelevant and autonomously computable updates, ACM Transactions on Database Systems (TODS), v.14 n.3, p.369-400, Sept. 1989
	Douglas C. Schmidt , Larry E. Druffel, A Fast Backtracking Algorithm to Test Directed Graphs for Isomorphism Using Distance Matrices, Journal of the ACM (JACM), v.23 n.3, p.433-445, July 1976
	Robert Endre Tarjan, A Unified Approach to Path Problems, Journal of the ACM (JACM), v.28 n.3, p.577-593, July 1981
	Michael J. Quinn , Narsingh Deo, Parallel graph algorithms, ACM Computing Surveys (CSUR), v.16 n.3, p.319-348, Sept. 1984
	Donald B. Johnson, A Note on Dijkstra's Shortest Path Algorithm, Journal of the ACM (JACM), v.20 n.3, p.385-388, July 1973
	Lawrence E. Druffel , Douglas C. Schmidt , Robert A. Wagner, A simple, efficient design automation processor, Proceedings of the 11th workshop on Design automation, p.127-136, January 1974
	Andrew C. Yao , David M. Avis , Ronald L. Rivest, An &Ohgr;(n2 log n) lower bound to the shortest paths problem, Proceedings of the ninth annual ACM symposium on Theory of computing, p.11-17, May 04-04, 1977, Boulder, Colorado, United States
	Jeffrey D. Oldham, Combinatorial approximation algorithms for generalized flow problems, Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, p.704-714, January 17-19, 1999, Baltimore, Maryland, United States
	David J. Pritchard, Load balanced deadlock-free deterministic routing of arbitrary networks, Proceedings of the 1992 ACM annual conference on Communications, p.225-234, March 03-05, 1992, Kansas City, Missouri, United States
	Ronald L. Graham , Andrew C. Yao , F. Frances Yao, Information Bounds Are Weak in the Shortest Distance Problem, Journal of the ACM (JACM), v.27 n.3, p.428-444, July 1980
	Paul Helman, A common schema for dynamic programming and branch and bound algorithms, Journal of the ACM (JACM), v.36 n.1, p.97-128, Jan. 1989
	Y. Han , V. Pan , John Reif, Efficient parallel algorithms for computing all pair shortest paths in directed graphs, Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures, p.353-362, June 29-July 01, 1992, San Diego, California, United States
	Kia Makki , Niki Pissinou , Ophir Frieder, Efficient solutions to multicast routing in communication networks, Mobile Networks and Applications, v.1 n.2, p.221-232, Oct. 1996
	David Eppstein , Joseph Wang, Fast approximation of centrality, Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, p.228-229, January 07-09, 2001, Washington, D.C., United States
	Sha Guo , Wei Sun , Mark A. Weiss, Solving satisfiability and implication problems in database systems, ACM Transactions on Database Systems (TODS), v.21 n.2, p.270-293, June 1996
	Alberto Martelli, A Gaussian Elimination Algorithm for the Enumeration of Cut Sets in a Graph, Journal of the ACM (JACM), v.23 n.1, p.58-73, Jan. 1976
	Hector Garcia-Molina , Lawrence R. Rogers, Performance through memory, ACM SIGMETRICS Performance Evaluation Review, v.15 n.1, p.122-131, May 1987
	Zahira Ammarguellat, A Control-Flow Normalization Algorithm and its Complexity, IEEE Transactions on Software Engineering, v.18 n.3, p.237-251, March 1992
	David R. Cecil, Graphs and enhancing Maple multiplication, Mathematics and Computer Education, v.36 n.1, p.62-69, September 2002
	Litong Song , Krishna Kavi, What can we gain by unfolding loops?, ACM SIGPLAN Notices, v.39 n.2, February 2004
	Maria João Cortinhal , Maria Eugénia Captivo, Genetic algorithms for the single source capacitated location problem, Metaheuristics: computer decision-making, Kluwer Academic Publishers, Norwell, MA, 2004
	Jennifer J. Xu , Hsinchun Chen, Fighting organized crimes: using shortest-path algorithms to identify associations in criminal networks, Decision Support Systems, v.38 n.3, p.473-487, December 2004
	D. R. O'Hallaron, Uniform Approach for Solving some Classical Problems on a Linear Array, IEEE Transactions on Parallel and Distributed Systems, v.2 n.2, p.236-241, April 1991
	Vachaspathi P. Kompella , Joseph C. Pasquale , George C. Polyzos, Multicast routing for multimedia communication, IEEE/ACM Transactions on Networking (TON), v.1 n.3, p.286-292, June 1993
	Monica S. Lam, Software pipelining: an effective scheduling technique for VLIW machines, ACM SIGPLAN Notices, v.39 n.4, April 2004
	Dilip Sarkar , Amar Mukherjee, Design of Optimal Systolic Algorithms for the Transitive Closure Problem, IEEE Transactions on Computers, v.41 n.4, p.508-512, April 1992
	Tatsuhiro Tsuchiya , Masatoshi Yamaguchi , Tohru Kikuno, Minimizing the Maximum Delay for Reaching Consensus in Quorum-Based Mutual Exclusion Schemes, IEEE Transactions on Parallel and Distributed Systems, v.10 n.4, p.337-345, April 1999
	Mikkel Thorup, Worst-case update times for fully-dynamic all-pairs shortest paths, Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, May 22-24, 2005, Baltimore, MD, USA
	C. J. Scheiman , P. R. Cappello, A Processor-Time-Minimal Systolic Array for Transitive Closure, IEEE Transactions on Parallel and Distributed Systems, v.3 n.3, p.257-269, May 1992
	Frank Guangsheng Zhang , Emanuel Melachrinoudis, The Maximin-Maxisum Network Location Problem, Computational Optimization and Applications, v.19 n.2, p.209-234, July 2001
	Sha Guo , Wei Sun , Mark A. Weiss, On Satisfiability, Equivalence, and Implication Problems Involving Conjunctive Queries in Database Systems, IEEE Transactions on Knowledge and Data Engineering, v.8 n.4, p.604-616, August 1996
	Madhumangal Pal , G. P. Bhattacharjee, An optimal parallel algorithm for all-pairs shortest paths on unweighted interval graphs, Nordic Journal of Computing, v.4 n.4, p.342-356, Winter 1997
	P. Cappello , Ö. Eğecioğlu , C. Scheiman, An introduction to processor-time-optimal systolic arrays, Highly parallel computaions: algorithms and applications, WIT Press, 001
	Jagan Sankaranarayanan , Houman Alborzi , Hanan Samet, Efficient query processing on spatial networks, Proceedings of the 13th annual ACM international workshop on Geographic information systems, November 04-05, 2005, Bremen, Germany
	Jennifer J. Xu , Hsinchun Chen, CrimeNet explorer: a framework for criminal network knowledge discovery, ACM Transactions on Information Systems (TOIS), v.23 n.2, p.201-226, April 2005
	Leonid Khachiyan , Endre Boros , Konrad Borys , Khaled Elbassioni , Vladimir Gurvich, Generating all vertices of a polyhedron is hard, Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, p.758-765, January 22-26, 2006, Miami, Florida
	Rezaul Alam Chowdhury , Vijaya Ramachandran, Cache-oblivious dynamic programming, Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, p.591-600, January 22-26, 2006, Miami, Florida
	Reinhard Schwarz , Friedemann Mattern, Detecting causal relationships in distributed computations: in search of the holy grail, Distributed Computing, v.7 n.3, p.149-174, March 1994
	Neil Kettle , Andy King, An anytime symmetry detection algorithm for ROBDDs, Proceedings of the 2006 conference on Asia South Pacific design automation, January 24-27, 2006, Yokohama, Japan
	U. Schwiegelshohn , L. Thiele, A Systolic Array for the Assignment Problem, IEEE Transactions on Computers, v.37 n.11, p.1422-1425, November 1988
	Paulius Micikevicius , Narsingh Deo, Cluster Computing for Determining Three-Dimensional Protein Structure, The Journal of Supercomputing, v.34 n.3, p.243-271, December 2005
	J. S. Reeve , K. Amarasinghe, A parallel Viterbi decoder for block cyclic and convolution codes, Signal Processing, v.86 n.2, p.273-278, February 2006
	Gerald Penn, Efficient transitive closure of sparse matrices over closed semirings, Theoretical Computer Science, v.354 n.1, p.72-81, 21 March 2006
	A. Teeninga , A. Volgenant, Improved heuristics for the traveling purchaser problem, Computers and Operations Research, v.31 n.1, p.139-150, January 2004
	Dino Ahr , Gerhard Reinelt, A tabu search algorithm for the min-max k-Chinese postman problem, Computers and Operations Research, v.33 n.12, p.3403-3422, December 2006
	A. Quirin , O. Cordón , J. Santamaría , B. Vargas-Quesada , F. Moya-Anegón, A new variant of the Pathfinder algorithm to generate large visual science maps in cubic time, Information Processing and Management: an International Journal, v.44 n.4, p.1611-1623, July, 2008
	Joaquín Bautista , Elena Fernández , Jordi Pereira, Solving an urban waste collection problem using ants heuristics, Computers and Operations Research, v.35 n.9, p.3020-3033, September, 2008
	Virginia Vassilevska , Ryan Williams, Finding a maximum weight triangle in n^3-Δ time, with applications, Proceedings of the thirty-eighth annual ACM symposium on Theory of computing, May 21-23, 2006, Seattle, WA, USA
	Pasquale Avella , Maurizio Boccia , Antonio Sforza , Igor Vasil'Ev, A Branch-and-Cut Algorithm for the Median-Path Problem, Computational Optimization and Applications, v.32 n.3, p.215-230, December 2005
	Tom Hazel , Laura Toma , Jan Vahrenhold , Rajiv Wickremesinghe, TerraCost: a versatile and scalable approach to computing least-cost-path surfaces for massive grid-based terrains, Proceedings of the 2006 ACM symposium on Applied computing, April 23-27, 2006, Dijon, France
	Matthew J. Rattigan , Marc Maier , David Jensen, Using structure indices for efficient approximation of network properties, Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, August 20-23, 2006, Philadelphia, PA, USA
	Daniel Bauer , John N. Daigle , Ilias Iliadis , Paolo Scotton, Topology aggregation for combined additive and restrictive metrics, Computer Networks: The International Journal of Computer and Telecommunications Networking, v.50 n.17, p.3284-3299, 5 December 2006
	Harvey M. Salkin, Educational series #5: integer programming by group theory, ACM SIGMAP Bulletin
	Alan P. Sprague, O(1) query time algorithm for all pairs shortest distances on permutation graphs, Discrete Applied Mathematics, v.155 n.3, p.365-373, February, 2007
	C. W. Duin, Two fast algorithms for all-pairs shortest paths, Computers and Operations Research, v.34 n.9, p.2824-2839, September, 2007
	E. I. Milovanović , I. Ž Milovanović , M. P. Bekakos , I. N. Tselepis, Computing all-pairs shortest paths on a linear systolic array and hardware realization on a reprogrammable FPGA platform, The Journal of Supercomputing, v.40 n.1, p.49-66, April 2007
	Kees van Hee , Alexander Serebrenik , Natalia Sidorova , Marc Voorhoeve , Jan van der Wal, Scheduling-free resource management, Data & Knowledge Engineering, v.61 n.1, p.59-75, April, 2007
	Ivo Bleylevens , Ralf Peeters , Bernard Hanzon, Efficiency improvement in an nD systems approach to polynomial optimization, Journal of Symbolic Computation, v.42 n.1-2, p.30-53, January, 2007
	Dietmar Ebner , Florian Brandner , Bernhard Scholz , Andreas Krall , Peter Wiedermann , Albrecht Kadlec, Generalized instruction selection using SSA-graphs, ACM SIGPLAN Notices, v.43 n.7, July 2008
	Yi Hu , Zhichun Xiao , Brajendra Panda, Modeling deceptive information dissemination using a holistic approach, Proceedings of the 2007 ACM symposium on Applied computing, March 11-15, 2007, Seoul, Korea
	Rezaul Alam Chowdhury , Vijaya Ramachandran, The cache-oblivious gaussian elimination paradigm: theoretical framework, parallelization and experimental evaluation, Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures, June 09-11, 2007, San Diego, California, USA
	Benjamin Doerr , Edda Happ , Christian Klein, Crossover can provably be useful in evolutionary computation, Proceedings of the 10th annual conference on Genetic and evolutionary computation, July 12-16, 2008, Atlanta, GA, USA
	Ruihong Huang, A Schedule-based Pathfinding Algorithm for Transit Networks Using Pattern First Search, Geoinformatica, v.11 n.2, p.269-285, June 2007
	Karsten Borgwardt , Sebastian Böttger , Hans-Peter Kriegel, VGM: visual graph mining, Proceedings of the 2006 ACM SIGMOD international conference on Management of data, June 27-29, 2006, Chicago, IL, USA
	Erol Gelenbe , Georgia Sakellari , Maurizio D'arienzo, Admission of QoS aware users in a smart network, ACM Transactions on Autonomous and Adaptive Systems (TAAS), v.3 n.1, p.1-28, March 2008
	Aditya N. Saharia , Yair M. Babad, Enhancing data warehouse performance through query caching, ACM SIGMIS Database, v.31 n.2, p.43-63, Spring 2000
	Roy Goldman , Narayanan Shivakumar , Suresh Venkatasubramanian , Hector Garcia-Molina, Proximity Search in Databases, Proceedings of the 24rd International Conference on Very Large Data Bases, p.26-37, August 24-27, 1998
	Jason Tsong-Li Wang , Dennis Shasha, Query Processing for Distance Metrics, Proceedings of the 16th International Conference on Very Large Data Bases, p.602-613, August 13-16, 1990
	Pierre Girodias , Eduard Cerny, Interface Timing Verification with Delay Correlation Using Constraint Logic Programming, Proceedings of the 1997 European conference on Design and Test, p.12, March 17-20, 1997
	Aditya N. Saharia , Yair M. Babad, Enhancing data warehouse performance through query caching, ACM SIGMIS Database, v.31 n.3, p.43-63, Summer 2000
	Stefano Bistarelli , Ugo Montanari , Francesca Rossi, Soft Constraint Logic Programming and Generalized Shortest Path Problems, Journal of Heuristics, v.8 n.1, p.25-41, January 2002
	Ning Chen , Anna R. Karlin, Cheap labor can be expensive, Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, p.707-715, January 07-09, 2007, New Orleans, Louisiana
	Sascha Häckel , Marco Fischer , David Zechel , Tobias Teich, A multi-objective ant colony approach for pareto-optimization using dynamic programming, Proceedings of the 10th annual conference on Genetic and evolutionary computation, July 12-16, 2008, Atlanta, GA, USA
	Scott C.-H. Huang , Hongwei Du , E-K. Park, Minimum-latency gossiping in multi-hop wireless networks, Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing, May 26-30, 2008, Hong Kong, Hong Kong, China
	Xianfang Sun , Edwin R. Hancock, Quasi-isometric parameterization for texture mapping, Pattern Recognition, v.41 n.5, p.1749-1760, May, 2008
	Kevin Grant , David Mould, Combining heuristic and landmark search for path planning, Proceedings of the 2008 Conference on Future Play: Research, Play, Share, November 03-05, 2008, Toronto, Ontario, Canada
	Lukasz Ziarek , Suresh Jagannathan , Matthew Fluet , Umut A. Acar, Speculative N-Way barriers, Proceedings of the 4th workshop on Declarative aspects of multicore programming, January 20-20, 2009, Savannah, GA, USA
	W. R. Crowther , F. E. Heart , A. A. McKenzie , J. M. McQuillan , D. C. Walden, Issues in packet switching network design, Proceedings of the May 19-22, 1975, national computer conference and exposition, May 19-22, 1975, Anaheim, California
	Hector Gonzalez , Jiawei Han , Xiaolei Li , Margaret Myslinska , John Paul Sondag, Adaptive fastest path computation on a road network: a traffic mining approach, Proceedings of the 33rd international conference on Very large data bases, September 23-27, 2007, Vienna, Austria
	Xianfang Sun , Edwin R. Hancock, Quasi-isometric parameterization for texture mapping, Pattern Recognition, v.41 n.5, p.1732-1743, May, 2008
	Gonzalo Navarro , Rodrigo Paredes , Edgar Chávez, t-Spanners for metric space searching, Data & Knowledge Engineering, v.63 n.3, p.820-854, December, 2007
	Gary J. Katz , Joseph T. Kider, Jr, All-pairs shortest-paths for large graphs on the GPU, Proceedings of the 23rd ACM SIGGRAPH/EUROGRAPHICS symposium on Graphics hardware, June 20-21, 2008, Sarajevo, Bosnia and Herzegovina
	Lina Khatib , Paul Morris , Robert Morris , Francesca Rossi , Alessandro Sperduti , K. Brent Venable, Solving and learning a tractable class of soft temporal constraints: Theoretical and experimental results, AI Communications, v.20 n.3, p.181-209, August 2007
	Mario Gerla, New line tariffs and their impact on network design, Proceedings of the May 6-10, 1974, national computer conference and exposition, May 06-10, 1974, Chicago, Illinois
	Louis Petingi, A diameter-constrained network reliability model to determine the probability that a communication network meets delay constraints, WSEAS TRANSACTIONS on COMMUNICATIONS, v.7 n.6, p.574-583, June 2008
	Louis Petingi, Combinatorial and computational properties of a diameter constrained network reliability model, Proceedings of the WSEAS International Conference on Applied Computing Conference, p.337-345, May 27-30, 2008, Istanbul, Turkey
	Benjamin N. Jackson , Patrick S. Schnable , Srinivas Aluru, Consensus Genetic Maps as Median Orders from Inconsistent Sources, IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB), v.5 n.2, p.161-171, April 2008
	Thomas Hazel , Laura Toma , Jan Vahrenhold , Rajiv Wickremesinghe, Terracost: Computing least-cost-path surfaces for massive grid terrains, Journal of Experimental Algorithmics (JEA), 12, June 2008
	Saddek Bensalem , Doron Peled , Hongyang Qu , Stavros Tripakis, Automatic generation of path conditions for concurrent timed systems, Theoretical Computer Science, v.404 n.3, p.275-292, September, 2008
	Jing Peng , Chang-jie Tang , Dong-qing Yang , Jing Zhang , Jian-jun Hu, Similarity computing model of high dimension data for symptom classification of Chinese traditional medicine, Applied Soft Computing, v.9 n.1, p.209-218, January, 2009
	Florian Kerschbaum , Andreas Schaad, Privacy-preserving social network analysis for criminal investigations, Proceedings of the 7th ACM workshop on Privacy in the electronic society, October 27-27, 2008, Alexandria, Virginia, USA
	Cedric Gondro , Brian P. Kinghorn, Optimization of cDNA Microarray Experimental Designs Using an Evolutionary Algorithm, IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB), v.5 n.4, p.630-638, October 2008
	M. Sugie , O. Menzilcioglu , H. T. Kung, CARGuide: on-board computer for automobile route guidance, Proceedings of the July 9-12, 1984, national computer conference and exposition, July 09-12, 1984, Las Vegas, Nevada
	Byung-In Kim , Sangwon Jeong, A comparison of algorithms for origin-destination matrix generation on real road networks and an approximation approach, Computers and Industrial Engineering, v.56 n.1, p.70-76, February, 2009
	Roberto Lublinerman , Christian Szegedy , Stavros Tripakis, Modular code generation from synchronous block diagrams: modularity vs. code size, Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, January 21-23, 2009, Savannah, GA, USA
	Ivan M. Pesic , Daniel W. Lewis, Three heuristics for improving centralized routing in large long-haul computer communication networks, Proceedings of the May 16-19, 1983, national computer conference, May 16-19, 1983, Anaheim, California
	Shmuel T. Klein, On the use of negation in Boolean IR queries, Information Processing and Management: an International Journal, v.45 n.2, p.298-311, March, 2009
	Jiefeng Cheng , Jeffrey Xu Yu, On-line exact shortest distance query processing, Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology, March 24-26, 2009, Saint Petersburg, Russia
	Robert Huber , Jens Klump, Charting taxonomic knowledge through ontologies and ranking algorithms, Computers & Geosciences, v.35 n.4, p.862-868, April, 2009
	Piyawan Kasemsuppakorn , Hassan A. Karimi, Personalised routing for wheelchair navigation, Journal of Location Based Services, v.3 n.1, p.24-54, March 2009
	Juan M. Corchado , Javier Bajo , Juan F. De Paz , Sara Rodríguez, An execution time neural-CBR guidance assistant, Neurocomputing, v.72 n.13-15, p.2743-2753, August, 2009
	Marc Comas , Maria Serna, Vertex fusion under distance constraints, European Journal of Combinatorics, v.30 n.7, p.1612-1623, October, 2009
	Sudip Misra , B. John Oommen, An Efficient Dynamic Algorithm for Maintaining All-Pairs Shortest Paths in Stochastic Networks, IEEE Transactions on Computers, v.55 n.6, p.686-702, June 2006
	Francesca Rossi , Kristen Brent Venable , Neil Yorke-Smith, Uncertainty in soft temporal constraint problems: a general framework and controllability algorithms for the fuzzy case, Journal of Artificial Intelligence Research, v.27 n.1, p.617-674, September 2006
	Joseph Bonneau , Jonathan Anderson , Ross Anderson , Frank Stajano, Eight friends are enough: social graph approximation via public listings, Proceedings of the Second ACM EuroSys Workshop on Social Network Systems, p.13-18, March 31-31, 2009, Nuremberg, Germany
	Maria Fox , Derek Long, Hybrid STAN: Identifying and managing combinatorial optimisation sub-problems in planning, Proceedings of the 17th international joint conference on Artificial intelligence, p.445-450, August 04-10, 2001, Seattle, WA, USA
	Xiaobin Wang , Hong Qu , Zhang Yi, A modified pulse coupled neural network for shortest-path problem, Neurocomputing, v.72 n.13-15, p.3028-3033, August, 2009
	Yuan Tian , Ken C. K. Lee , Wang-Chien Lee, Monitoring minimum cost paths on road networks, Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, November 04-06, 2009, Seattle, Washington
	Lang Fan , Christine L. Mumford , Dafydd Evans, A simple multi-objective optimization algorithm for the urban transit routing problem, Proceedings of the Eleventh conference on Congress on Evolutionary Computation, p.1-7, May 18-21, 2009, Trondheim, Norway
	T. C. Hu , W. T. Torres, Shortcut in the decomposition algorithm for shortest paths in a network, IBM Journal of Research and Development, v.13 n.4, p.387-390, July 1969
	A. J. Hoffman , S. Winograd, Finding all shortest distances in a directed network, IBM Journal of Research and Development, v.16 n.4, p.412-414, July 1972
	T. E. Tedijanto , R. O. Onvural , D. C. Verma , L. Gün , R. A. Guérin, NBBS path selection framework, IBM Systems Journal, v.34 n.4, p.629-639, 1995
	Jean-François Cordeau , Mauro Dell'Amico , Manuel Iori, Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading, Computers and Operations Research, v.37 n.5, p.970-980, May, 2010
	Christian Wulff-Nilsen, Computing the dilation of edge-augmented graphs in metric spaces, Computational Geometry: Theory and Applications, v.43 n.2, p.68-72, February, 2010
	Michalis Potamias , Francesco Bonchi , Carlos Castillo , Aristides Gionis, Fast shortest path distance estimation in large networks, Proceeding of the 18th ACM conference on Information and knowledge management, November 02-06, 2009, Hong Kong, China
	Maytham Safar , Hussain Sawwan , Mahmoud Taha , Talal Al-Fadhli, Virtual social networks online and mobile systems, Mobile Information Systems, v.5 n.3, p.233-253, August 2009
	K. Maruyama, Defining routing tables for SNA networks, IBM Systems Journal, v.22 n.4, p.435-450, December 1983
	Octavian Udrea , Diego Reforgiato Recupero , V. S. Subrahmanian, Annotated RDF, ACM Transactions on Computational Logic (TOCL), v.11 n.2, p.1-41, January 2010
	Doron Peled , Hongyang Qu, Enforcing Concurrent Temporal Behaviors, Electronic Notes in Theoretical Computer Science (ENTCS), 113, p.65-83, January, 2005

Collaborative Colleagues:

Robert W. Floyd: colleagues

Adobe Acrobat

QuickTime

Windows Media Player

Real Player