A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its Applications.
Beate BolligPhilipp WoelfelPublished in: MFCS (2002)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- max sat
- branch and bound
- lower and upper bounds
- graph representation
- worst case
- constant factor
- graph theory
- graph matching
- structured data
- directed graph
- weighted graph
- graph structure
- graph model
- objective function
- connected components
- random walk
- search algorithm
- directed acyclic graph
- special case
- graph databases
- spanning tree
- finite state
- optimal solution
- learning algorithm
- linear programming relaxation
- machine learning