Skip to main content
null
Internet Mathematics
  • Menu
  • Articles
    • General
    • Special Issue for WAW'15
    • Special Issue for WAW'16
    • All
  • For Authors
  • Editorial Board
  • About
  • Issues
  • Blog
  • search

RSS Feed

Enter the URL below into your favorite RSS reader.

http://localhost:21432/feed
General
Vol. 11, Issue 4, 2015September 02, 2015 EDT

Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection

Md. Mostofa Ali Patwary, Wei-keng Liao, Alok Choudhary, Bharath Pattabiraman, Assefaw H. Gebremedhin,
math
https://doi.org/10.1080/15427951.2014.986778
Internet Mathematics
Patwary, Md. Mostofa Ali, Wei-keng Liao, Alok Choudhary, Bharath Pattabiraman, and Assefaw H. Gebremedhin. 2015. “Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection.” Internet Mathematics 11 (4). https:/​/​doi.org/​10.1080/​15427951.2014.986778.
Save article as...▾

View more stats

This website uses cookies

We use cookies to enhance your experience and support COUNTER Metrics for transparent reporting of readership statistics. Cookie data is not sold to third parties or used for marketing purposes.

Powered by Scholastica, the modern academic journal management system