Randomised Algorithms for Finding Small Weakly-Connected Dominating Sets of Regular Graphs.

William Duckworth Bernard Mans

Published in: CIAC (2003)

Keyphrases

graph theory
computational complexity
times faster
computational cost
orders of magnitude
learning algorithm
significant improvement
computationally efficient
connected components
optimization problems
pattern mining
representational power
maximum clique