Back to Results
First PageMeta Content
Graph connectivity / Network theory / Search algorithms / Routing algorithms / Bellman–Ford algorithm / Shortest path problem / Distance / Tree / Path / Graph theory / Mathematics / Theoretical computer science


Document Date: 2005-06-09 21:14:48

Open Document

File Size: 384,97 KB

Share Result on Facebook

Company

Ford / /

Country

United States / /

Currency

pence / /

/

Facility

USA Macalester College / /

IndustryTerm

simplest algorithm / graph algorithm / upper bound algorithms / instantaneous solutions / polynomial-time algorithm / quadratic-time algorithm / nonnegative integer solutions / induction-based algorithm / breadth-first search algorithm / polynomialtime algorithm / breadthfirst search / /

Organization

Macalester College / /

Person

David Einstein / Joan Hutchinson / Mark Sheingorn / Christopher Groer / Albert Nijenhuis Stan Wagon Seattle / /

Position

shortest-path graph model for the Frobenius problem / head / /

ProgrammingLanguage

Mathematica / /

ProvinceOrState

Wisconsin / Minnesota / North Dakota / /

Technology

BFD algorithm / RRTree algorithm / graph algorithm / search algorithm / polynomial-time algorithm / 8 BFD ALGORITHM / Kannan algorithm / quadratic-time algorithm / ND algorithm / upper bound algorithms / induction-based algorithm / polynomialtime algorithm / second algorithm / Existing Algorithms The ND algorithm / simplest algorithm / /

SocialTag