Algebraic bounds for heterogeneous site percolation on directed and undirected graphs.
Kathleen E. HamiltonLeonid P. PryadkoPublished in: Discret. Appl. Math. (2017)
Keyphrases
- undirected graph
- directed graph
- website
- approximation algorithms
- directed acyclic graph
- upper bound
- disjoint paths
- complex networks
- spanning tree
- minimum cost
- vertex set
- worst case
- connected components
- scale free
- random graphs
- upper and lower bounds
- lower bound
- undirected graphical models
- multicommodity flow
- graph structure
- strongly connected
- data structure
- np hard
- special case
- objective function