Lower bounds on the OBDD size of two fundamental functions' graphs.
Daniel SawitzkiPublished in: Inf. Process. Lett. (2007)
Keyphrases
- lower bound
- upper bound
- model checking
- upper and lower bounds
- graph theoretic
- branch and bound algorithm
- objective function
- branch and bound
- lower and upper bounds
- vc dimension
- running times
- maximal cliques
- np hard
- computational complexity
- uniform random
- graph structure
- optimal cost
- graph partitioning
- graph databases
- worst case
- data structure