Erratum: An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
type: Item
instance of: scholarly article
title: Erratum: An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
zbMATH Open document ID: 1180.90365
author: Etsuji Tomita
author: Toshikatsu Kameda
published in: Journal of Global Optimization
publication date: 2009-09-01T00:00:00Z
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 5600759
MaRDI profile type: Publication
full work available at URL: s10898-008-9362-2
OpenAlex ID: W4247132858
DOI: 10.1007/S10898-008-9362-2
description: scientific article; zbMATH DE number 5600759