𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Human disease: Edges, nodes and networks

✍ Scribed by Muers, Mary

Book ID
109953133
Publisher
Nature Publishing Group
Year
2009
Tongue
English
Weight
174 KB
Volume
11
Category
Article
ISSN
1471-0056

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Resilience of partial k-tree networks wi
Resilience of partial k-tree networks with edge and node failures
✍ Erick Mata-Montero πŸ“‚ Article πŸ“… 1991 πŸ› John Wiley and Sons 🌐 English βš– 965 KB

The resilience of a network is the expected number of pairs of nodes that can communicate. Computing the resilience of a network is a #P-complete problem even for planar networks with fail-safe nodes. We generalize an O(n\*) time algorithm to compute the resilience of n-node k-tree networks with fai

Interactome Networks and Human Disease
Interactome Networks and Human Disease
✍ Marc Vidal; MichaelΒ E. Cusick; Albert-LΓ‘szlΓ³ BarabΓ‘si πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 670 KB
Edge connectivity between nodes and node
Edge connectivity between nodes and node-subsets
✍ Ito, Hiro; Yokoyama, Mitsuo πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 135 KB

Let G Γ… (V, E) be a graph where V and E are a set of nodes and a set of edges, respectively. Let X Γ… {V 1 , V 2 , . . . , V p }, V i βŠ† V be a family of node-subsets. Each node-subset V i is called an area, and a pair of G and X is called an area graph. A node Β£ √ V and an area V i √ X are called k-N