BBMCW

swMATH21469MaRDI QIDQ33276FDOQ33276

Author name not available (Why is that?)

Official website: http://www.tandfonline.com/doi/full/10.1080/10556788.2017.1281924

Described by source

• An enhanced bitstring encoding for exact maximum clique search in sparse graphs

Cited In (10)

• The maximum independent union of cliques problem: complexity and exact approaches
• BHOSLIB
• MaxCliqueDyn
• BBMCL
• BBMCSP
• On comparing algorithms for the maximum clique problem
• BITSCAN
• IncMaxCLQ
• PMC
• Why is maximum clique often easy in practice?

This page was built for software: BBMCW