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

Efficient (k, α)-Maximal-Cliques Enumeration Over Uncertain Graphs.

Jing BaiJunfeng ZhouMing DuPeng Zhong
Published in: IEEE Access (2021)
Keyphrases
  • maximal cliques
  • maximal clique enumeration
  • graph theory
  • graph theoretic
  • maximum clique
  • perturbation theory
  • complex networks
  • data mining
  • association graph