✦ LIBER ✦

Ecological subsystems via graph theory: the role of strongly connected components

✍ Scribed by Stefano Allesina; Antonio Bodini; Cristina Bondavalli

Book ID: 110742403
Publisher: John Wiley and Sons
Year: 2005
Tongue: English
Weight: 195 KB
Volume: 110
Category: Article
ISSN: 0030-1299
DOI: 10.1111/j.0030-1299.2005.13082.x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Quasi-stationary distributions as centra

Quasi-stationary distributions as centrality measures for the giant strongly connected component of a reducible graph

✍ Konstantin Avrachenkov; Vivek Borkar; Danil Nemirovsky 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 413 KB

A random walk can be used as a centrality measure of a directed graph. However, if the graph is reducible the random walk will be absorbed in some subset of nodes and will never visit the rest of the graph. In Google PageRank the problem was solved by the introduction of uniform random jumps with so

[Lecture Notes in Computer Science] Theo

[Lecture Notes in Computer Science] Theory and Practice of Algorithms in (Computer) Systems Volume 6595 || Computing Strongly Connected Components in the Streaming Model

✍ Marchetti-Spaccamela, Alberto; Segal, Michael 📂 Article 📅 2011 🏛 Springer Berlin Heidelberg ⚖ 268 KB