Cite

HARVARD Citation

    San Segundo, P. et al. (2016). A new exact maximum clique algorithm for large and massive sparse graphs. Computers & operations research. pp. 81-94. [Online]. 
  
Back to record