The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected.
J. Scott ProvanMichael O. BallPublished in: SIAM J. Comput. (1983)
Keyphrases
- connected components
- neighborhood graph
- computational cost
- graph model
- graph mining
- structured data
- directed acyclic graph
- graph structure
- graph theory
- computational complexity
- graph partitioning
- space complexity
- bipartite graph
- probability distribution
- probabilistic model
- decision problems
- weighted graph
- binary images
- random walk
- worst case
- graph theoretic
- similarity scores
- social networks
- stable set
- polynomial time complexity
- connected graphs
- jump diffusion process