filmov
tv
Graph Theory Blink 3.2 (Connected components in directed and undirected graphs)

Показать описание
A roadmap to navigate Graph Theory Blinks.
This course comes at the intersection of mathematics, learning, and algorithms.
*** Primarily textbooks:
1) Bullmore, Edward T._ Fornito, Alex_ Zalesky, Andrew - Fundamentals of Brain Network Analysis-Academic Press,Elsevier (2016)
2) Arthur Benjamin, Gary Chartrand, Ping Zhang - The Fascinating World of Graph Theory-Princeton University Press (2015)
3) (Graduate Texts in Mathematics) Reinhard Diestel - Graph theory-Springer (2006)
*** Library: SNAP library (network analysis tool),
=========================================================================================
Lecture 3 will cover connected components, graph robustness, and fragmentation.
=========================================================================================
3. Graph interconnectedness
3.1 Connected components in directed and undirected graphs
3.2 Percolation and robustness of a graph
**** Resources and further readings ****
**** Source code ****
This course comes at the intersection of mathematics, learning, and algorithms.
*** Primarily textbooks:
1) Bullmore, Edward T._ Fornito, Alex_ Zalesky, Andrew - Fundamentals of Brain Network Analysis-Academic Press,Elsevier (2016)
2) Arthur Benjamin, Gary Chartrand, Ping Zhang - The Fascinating World of Graph Theory-Princeton University Press (2015)
3) (Graduate Texts in Mathematics) Reinhard Diestel - Graph theory-Springer (2006)
*** Library: SNAP library (network analysis tool),
=========================================================================================
Lecture 3 will cover connected components, graph robustness, and fragmentation.
=========================================================================================
3. Graph interconnectedness
3.1 Connected components in directed and undirected graphs
3.2 Percolation and robustness of a graph
**** Resources and further readings ****
**** Source code ****