Extremal bounds for probabilistic polling in graphs.
Yehuda HassinDavid PelegPublished in: SIROCCO (2000)
Keyphrases
- graph theory
- upper bound
- probabilistic model
- bayesian networks
- lower bound
- generative model
- graph structure
- asymptotically optimal
- learning automata
- graph matching
- np hard
- graph theoretic
- upper and lower bounds
- probability theory
- subgraph isomorphism
- probabilistic networks
- heavy traffic
- random graphs
- graph clustering
- lower and upper bounds
- vc dimension
- graph partitioning
- spanning tree
- graph model
- weighted graph
- pairwise