Lower Bounds on Graph Threading by Probabilistic Machines (Preliminary Version)
Piotr BermanJanos SimonPublished in: FOCS (1983)
Keyphrases
- preliminary version
- lower bound
- upper bound
- min sum
- graph representation
- np hard
- graph theory
- branch and bound algorithm
- generative model
- graph structure
- structured data
- objective function
- worst case
- graph model
- connected components
- random walk
- bayesian networks
- lower and upper bounds
- constant factor
- branch and bound
- bipartite graph
- graph mining
- graph partitioning
- linear programming
- vc dimension