Graph Theory

Creator

Creator

Seonglae Cho

Created

Created

2019 Nov 6 13:45

Editor

Editor

Seonglae Cho

Edited

Edited

2024 Oct 24 9:15

Refs

Refs

Most important one in
Algorithm

Naturally occurring structures are hierarchical locally, but exhibit a network structure globally

Graph Theory Notion

Distance Algorithm

Maximum Flow & Minimum-Cost Flow Algorithm

Induced subgraph

Eulerian path

In mathematics, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects. A graph in this context is made up of vertices which are connected by edges. A distinction is made between undirected graphs, where edges link two vertices symmetrically, and directed graphs, where edges link two vertices asymmetrically. Graphs are one of the principal objects of study in discrete mathematics.

https://en.wikipedia.org/wiki/Graph_theory

Graph theory

Researchers Achieve 'Absurdly Fast' Algorithm for Network Flow | Quanta Magazine

Researchers soon started exploring how to apply this advance to the maximum flow problem. The idea is to imagine our highway network as a network of wires and to turn up the resistance on the highways that don't have much available capacity, to discourage electrons from running through them.

Researchers Achieve 'Absurdly Fast' Algorithm for Network Flow | Quanta Magazine

https://www.quantamagazine.org/researchers-achieve-absurdly-fast-algorithm-for-network-flow-20220608

Researchers Achieve 'Absurdly Fast' Algorithm for Network Flow | Quanta Magazine

Recommendations

///