Finding Smooth Graphs with Small Independence Numbers

Benedikt Klocker, Herbert Fleischner, Günther Raidl
January 2018
PDF bib

Abstract

Full Citation:

Benedikt Klocker, Herbert Fleischner, Günther R. Raidl. Finding Smooth Graphs with Small Independence Numbers. MOD~2017: Machine Learning, Optimization, and Big Data – Third International Conference (Giovanni Giuffrida, Giuseppe Nicosia, Panos Pardalos, Renato Umeton, eds.), volume 10710 of LNCS, pages 527-539, 2018, Springer.

Type
Conference Paper
Branch and Bound Combinatorial Optimization Smooth Graphs
Günther Raidl
Günther Raidl

Günther Raidl is a Professor at the Algorithms and Complexity Group.