This paper proposes an efficient branch-and-bound algorithm and its parallel version to enumerate all maximal k-plexes with at least q vertices in large graphs.
