Upper Bounds for the Domination Numbers of Graphs Using Turán's Theorem and Lovász Local Lemma.
Sharareh AlipourAmir JafariPublished in: Graphs Comb. (2019)
Keyphrases
- constant factor
- upper bound
- lower bound
- worst case
- approximation algorithms
- upper and lower bounds
- graph theoretic
- tight bounds
- lower and upper bounds
- graph matching
- branch and bound
- directed graph
- series parallel
- sample size
- branch and bound algorithm
- graph theory
- graph structure
- graph partitioning
- graph representation
- machine learning
- error probability
- digital topology
- johnson lindenstrauss
- graph clustering
- graph model
- graph mining
- bipartite graph