Erratum: An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
From MaRDI portal
Publication:839051
DOI10.1007/s10898-008-9362-2zbMath1180.90365MaRDI QIDQ839051
Etsuji Tomita, Toshikatsu Kameda
Publication date: 1 September 2009
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-008-9362-2
90C35: Programming involving graphs or networks
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Local search with edge weighting and configuration checking heuristics for minimum vertex cover, An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments