Back to Results
First PageMeta Content
Network flow / Operations research / Routing algorithms / Network theory / Bellman–Ford algorithm / Shortest path problem / Dynamic programming / Induced path / Maximum flow problem / Mathematics / Graph theory / Theoretical computer science


COMS21103 Given a (weighted, directed) graph G and a pair of vertices s and t, we would like to find a shortest path from s to t. A fundamental task with many applications:
Add to Reading List

Document Date: 2014-01-08 09:09:07

Open Document

File Size: 1,83 MB

Share Result on Facebook

City

Reading / /

Company

Ford / MIT Press / McGraw-Hill / RAND Corporation / /

Country

United Kingdom / /

Currency

USD / GBP / /

/

Facility

University of Bristol Bristol / University of Southern California / /

IndustryTerm

valid solution / Traffic information systems / Internet routing / shortest-path algorithms / /

Organization

University of Illinois / Ashley Montanaro ashley@cs.bris.ac.uk Department of Computer Science / University of Southern California / MIT / A -1 / Mathematical Association of America / University of Bristol Bristol / Stanford / /

Person

Lester Ford / Jr. / Richard E. Bellman / be solved using Bellman-Ford / Jeff Erickson / /

Position

Author / President / mathematician / /

Product

Pentax K-x Digital Camera / /

ProgrammingLanguage

C / /

ProvinceOrState

Southern California / /

Region

Southern California / /

Technology

This algorithm / OSPF routing algorithm / shortest-path algorithms / /

URL

http /

SocialTag