BBMCW

swMATH21469MaRDI QIDQ33276FDOQ33276

Author name not available (Why is that?)

Described by source

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

Cited In (3)

• The maximum independent union of cliques problem: complexity and exact approaches
• Why Is Maximum Clique Often Easy in Practice?
• On comparing algorithms for the maximum clique problem

This page was built for software: BBMCW