"A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique."

Etsuji Tomita et al. (2016)

Details and statistics

DOI: 10.1007/978-3-319-39817-4_21

access: closed

type: Conference or Workshop Paper

metadata version: 2022-10-02

a service of  Schloss Dagstuhl - Leibniz Center for Informatics