graph theory
my notes on graph theory are very messy (for now)..
nodes
- graph, subgraph, edge, vertex
- path, minimal path, cut
- bfs and dfs
- edge-induced subgraph, vertex-induced subgraph
- minimum spanning tree
- dijkstra's algorithm
- bellman-ford algorithm
- floyd-warshall algorithm
- prim's algorithm
- kruskal's algorithm
- ford–fulkerson algorithm
- edmonds-karp algorithm
- graph embedding, edge-centric graph, edge contraction, graph separator, graph cycle, mssp, sssp, planar graphs course homework 1, planar graphs course homework 2, planar graphs course homework 3, planar graphs course homework 4, decomposition tree, connected-components tree, totally monotone matrix
books
(princ
(book-collage
(list
"blk:1724088767.5355105"
"blk:1719578844.4639564"
"blk:1731528452.8913064"
"[[blk:1729190427.175788][optimization algorithms for planar graphs shay mozes and klein book]]"
)))