z-logo
open-access-imgOpen Access
A Fast Algorithm to Compute Maximum <i>k</i>-Plexes in Social Network Analysis
Author(s) -
Mingyu Xiao,
Weibo Lin,
Yuanshun Dai,
Yifeng Zeng
Publication year - 2017
Publication title -
proceedings of the ... aaai conference on artificial intelligence
Language(s) - English
Resource type - Journals
eISSN - 2374-3468
pISSN - 2159-5399
DOI - 10.1609/aaai.v31i1.10655
Subject(s) - vertex (graph theory) , combinatorics , induced subgraph , graph , mathematics , clique , algorithm , running time , vertex connectivity , relaxation (psychology) , discrete mathematics , psychology , social psychology

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here