Fast Approximation Algorithms for Finding Node-Independent Paths in Networks
Year of publication: |
2001-07
|
---|---|
Authors: | White, Douglas R. ; Newman, M. E. J. |
Institutions: | Santa Fe Institute |
Subject: | Graph theory | social networks | cohesion | algorithms |
-
Mathematical models and routing algorithms for economical cutting tool paths
Makarovskikh, T. A., (2018)
-
Knowledge integration between technical change and strategy making
Brusoni, Stefano, (2021)
-
Social networks and the process of globalization
Duernecker, Georg, (2018)
- More ...
-
Structural Cohesion and Embeddedness: A Hierarchical Conception of Social Groups
Moody, James, (2000)
-
Dynamics of a Simple Evolutionary Process
Stauffer, Dietrich, (2001)
-
Scaling and Percolation in the Small-World Network Model
Newman, M. E. J., (1999)
- More ...