Independent domination in finitely defined classes of graphs: Polynomial algorithms.

Vadim V. Lozin Raffaele Mosca Christopher Purcell

Published in: Discret. Appl. Math. (2015)

Keyphrases

computationally efficient
learning algorithm
graph theory
benchmark datasets
orders of magnitude
times faster
data sets
significant improvement
computational cost
optimization problems
clustering algorithm
lower bound
theoretical analysis
max cut