New upper bounds for the integrity of cubic graphs.
Mustafa AticiRobert CrawfordClaus ErnstPublished in: Int. J. Comput. Math. (2004)
Keyphrases
- upper bound
- lower bound
- upper and lower bounds
- worst case
- branch and bound algorithm
- lower and upper bounds
- branch and bound
- sample complexity
- efficiently computable
- graph theoretic
- generalization error
- integrity checking
- tight bounds
- graph theory
- bipartite graph
- directed graph
- integrity constraints
- graph databases
- graph representation
- graph structure
- data protection
- permutation flowshop
- np hard