Lower Bounds for the Sum of Graph--driven Read--Once Parity Branching Programs
Matthias HomeisterPublished in: Electron. Colloquium Comput. Complex. (2003)
Keyphrases
- lower bound
- min sum
- max sat
- objective function
- upper bound
- random walk
- np hard
- graph theory
- graph representation
- upper and lower bounds
- branch and bound algorithm
- optimal solution
- goal programming
- lower and upper bounds
- error correction
- graph matching
- graph model
- spanning tree
- graph partitioning
- weighted graph
- graph structure
- directed graph
- graph mining
- vc dimension
- bipartite graph
- branch and bound
- constant factor