by Benedikt Klocker, Herbert Fleischner, Günther R. Raidl
Reference:
Finding Smooth Graphs with Small Independence NumbersBenedikt Klocker, Herbert Fleischner, Günther R. RaidlMOD 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.
Bibtex Entry:
@inproceedings{klocker:2017c,
author={Klocker, Benedikt and Fleischner, Herbert and Raidl,
G{\"u}nther R.},
title={Finding Smooth Graphs with Small Independence Numbers},
booktitle={MOD~2017: Machine Learning, Optimization, and Big Data -- Third International Conference},
series={LNCS},
volume = 10710,
pages = {527-539},
editor={Giuffrida, Giovanni and Nicosia, Giuseppe and Pardalos, Panos and Umeton, Renato},
publisher={Springer},
year = {2018},
url={https://www.ac.tuwien.ac.at/files/pub/klocker-17c.pdf},
keywords = {branch and bound, smooth graphs, combinatorial optimization}
}