• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees.

Charalampos E. TsourakakisFrancesco BonchiAristides GionisFrancesco GulloMaria A. Tsiarli
Published in: KDD (2013)
Keyphrases
  • graph mining
  • quasi cliques
  • quality guarantees
  • dynamic programming
  • graph databases
  • pattern mining
  • bayesian networks
  • frequently occurring
  • information extraction
  • worst case
  • biological networks