Given a user-specified minimum degree threshold \gamma , a%DIFDELCMD < {%%% \gamma -quasi-clique is a subgraph  where each vertex  connects to at least \gamma fraction of the other vertices . Mining maximal\lceil \rceil  quasi-cliques is notoriously expensive with the state-of-the-art algorithm scaling only to small graphs with thousands of vertices.
<coherence> Given a user-specified minimum degree threshold \gamma , a%DIFDELCMD < {%%% \gamma -quasi-clique is a subgraph  where each vertex  connects to at least \gamma fraction of the other vertices . Mining maximal\lceil \rceil  quasi-cliques is notoriously expensive with the state-of-the-art algorithm scaling only to small graphs with thousands of vertices.
Given a user-specified minimum degree threshold \gamma , a%DIFDELCMD < {%%% \gamma -quasi-clique is a subgraph where each vertex connects to at least \gamma fraction of the other vertices (i.e.,\lceil \rceil quasi-cliques is notoriously expensive with the state-of-the-art algorithm scaling only to small graphs with thousands of vertices.