Loading [Contrib]/a11y/accessibility-menu.js
Internet Mathematics
  • Menu
  • Articles
    • General
    • Special Issue for WAW'15
    • Special Issue for WAW'16
    • All
  • For Authors
  • Editorial Board
  • About
  • Issues
  • Blog
  • search

    Sorry, something went wrong. Please try your search again.
    ×

    • Articles
    • Blog posts

RSS Feed

Enter the URL below into your favorite RSS reader.

https://www.internetmathematicsjournal.com/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

Alok Choudhary, Bharath Pattabiraman, Md. Mostofa Ali Patwary, Assefaw H. Gebremedhin, Wei-keng Liao,
math
• https://doi.org/10.1080/15427951.2014.986778
Internet Mathematics
Choudhary, Alok, Bharath Pattabiraman, Md. Mostofa Ali Patwary, Assefaw H. Gebremedhin, and Wei-keng Liao. 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...▾
  • PDF
  • XML
  • Citation (BibTeX)

View more stats

Powered by Scholastica, the modern academic journal management system