EE365: Deterministic Finite State Control Deterministic optimal control Shortest path problem Dynamic programming Examples

Source URL: www.nicholasmoehle.com

We approach the problem of computing geometric centralities, such as closeness and harmonic centrality, on very large graphs; traditionally this task requires an all-pairs shortest-path computation in the exact case, or

Source URL: mmds-data.org

We approach the problem of computing geometric centralities, such as closeness and harmonic centrality, on very large graphs; traditionally this task requires an all-pairs shortest-path computation in the exact case, or

Source URL: mmds-data.org

Improving Restoration Success in Mesh Optical Networks Fang Yu 1, Rakesh Sinha2, Dongmei Wang3, Guangzhi Li3, John Strand2, Robert Doverspike2, Charles Kalmanek 3, and Bruce Cortez 2 1 EECS Department, UC Berkeley, Berke

Source URL: sahara.cs.berkeley.edu

• Network architecture
• Computing
• Fiber-optic communications
• Network protocols
• Computer architecture
• Routing
• Automatically switched optical network
• Synchronous optical networking
• Bandwidth
• Multiprotocol Label Switching
• Shortest path problem

CS261: A Second Course in Algorithms Lecture #2: Augmenting Path Algorithms for Maximum Flow∗ Tim Roughgarden† January 7, 2016

Source URL: theory.stanford.edu

• Graph theory
• Network flow
• Mathematics
• EdmondsKarp algorithm
• Flow network
• Maximum flow problem
• FordFulkerson algorithm
• Cut
• Graph traversal
• Minimum cut
• Shortest path problem
• Max-flow min-cut theorem

Second International Conference on Multiagent SystemsDistributed Breakout Algorithm for Solving Distributed Constraint Satisfaction Problems Makoto Yokoo

Source URL: agent.inf.kyushu-u.ac.jp

• Constraint programming
• Mathematics
• Constraint satisfaction problem
• Constraint satisfaction
• Algorithm
• Shortest path problem
• Theoretical computer science
• Min-conflicts algorithm
• Distributed constraint optimization

The Graph BLAS effort and its implications for Exascale David  Bader  (GA  Tech),  Aydın  Buluç  (LBNL), John  Gilbert  (UCSB),   Joseph  Gonzalez  (UCB),  Jeremy  Kepner  (MIT

Source URL: gauss.cs.ucsb.edu

• Graph theory
• Mathematics
• Discrete mathematics
• Network theory
• Algebraic graph theory
• Centrality
• Graph
• Betweenness centrality
• Matching
• Shortest path problem
• Book:Graph Theory

155 Documenta Math. On the History of the Shortest Path Problem Alexander Schrijver

Source URL: www.math.uiuc.edu

• Mathematics
• Graph theory
• Discrete mathematics
• Edsger W. Dijkstra
• Routing algorithms
• Operations research
• Network theory
• Shortest path problem
• Dynamic programming
• Distance
• Path
• Linear programming

LNCSEfficient Dynamic Aggregation

Source URL: webee.technion.ac.il

• Graph theory
• Mathematics
• Computational complexity theory
• Edsger W. Dijkstra
• Network theory
• Shortest path problem
• Minimum spanning tree
• Network flow
• Dynamic programming

Microsoft Worddoc

Source URL: publik.tuwien.ac.at

• Mathematics
• Routing algorithms
• Edsger W. Dijkstra
• Graph theory
• Applied mathematics
• Search algorithms
• Game artificial intelligence
• Combinatorial optimization
• A* search algorithm
• Shortest path problem
• Maze
• Algorithm