Local improving algorithms for large cuts in graphs with maximum degree three.

Stanislaw Bylka

Published in: Discret. Math. (2001)

Keyphrases

graph theory
orders of magnitude
optimization problems
combinatorial optimization
computational complexity
computational cost
worst case
times faster
learning algorithm
association rules
itemsets
theoretical analysis
machine learning algorithms
graph matching
graph structures