Upper bounds for inverse domination in graphs.
Elliot KropJessica McDonaldGregory J. PuleoPublished in: CoRR (2019)
Keyphrases
- upper bound
- lower bound
- tight bounds
- upper and lower bounds
- upper bounding
- worst case
- branch and bound algorithm
- lower and upper bounds
- graph matching
- graph theoretic
- generalization error
- graph representation
- sample complexity
- series parallel
- branch and bound
- undirected graph
- concept classes
- subgraph isomorphism
- tight upper and lower bounds
- error probability
- efficiently computable
- graph kernels
- graph mining
- graph structure
- graph theory
- pattern mining
- dynamic programming