Name
Abstract | ||
|---|---|---|
In this article, we consider isolated cliques and isolated dense subgraphs. For a given graph G, a vertex subset S of size k (and also its induced subgraph G(S)) is said to be c-isolated if G(S) is connected to its outside via less than ck edges. The number c is sometimes called the isolation factor. The subgraph appears more isolated if the isolation factor is smaller. The main result in this work shows that for a fixed constant c, we can enumerate all c-isolated maximal cliques (including a maximum one, if any) in linear time. In more detail, we show that, for a given graph G of n vertices and m edges, and a positive real number c, all c-isolated maximal cliques can be enumerated in time O( c4 22cm). From this, we can see that: (1) if c is a constant, all c-isolated maximal cliques can be enumerated in linear time, and (2) if c &equlas; O(log n), all c-isolated maximal cliques can be enumerated in polynomial time. Moreover, we show that these bounds are tight. That is, if f(n) is an increasing function not bounded by any constant, then there is a graph of n vertices and m edges for which the number of f(n)-isolated maximal cliques is superlinear in n + m. Furthermore, if f(n) = ω(log n), there is a graph of n vertices and m edges for which the number of f(n)-isolated maximal cliques is superpolynomial in n + m. We next introduce the idea of pseudo-cliques. A pseudo-clique having an average degree α and a minimum degree β, denoted by PC(α,β), is a set V′ ⊆ V such that the subgraph induced by V′ has an average degree of at least α and a minimum degree of at least β. This article investigates these, and obtains some cases that can be solved in polynomial time and some other cases that have a superpolynomial number of solutions. Especially, we show the following results, where k is the number of vertices of the isolated pseudo-cliques: (1) For any ϵ 0 there is a graph of n vertices for which the number of 1-isolated PC(k − (log k)1 + ϵ, k/(log k)1 + ϵ) is superpolynomial, and (2) there is a polynomial-time algorithm which enumerates all c-isolated PC(k − log k, k/log k), for any constant c. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1145/1597036.1597044 | ACM Transactions on Algorithms |
Keywords | Field | DocType |
n vertex,isolated maximal clique,m edge,log n,c-isolated maximal clique,clique,log k,isolation,average degree,graph g,polynomial time,linear time,isolated clique,enumeration | Discrete mathematics,Binary logarithm,Combinatorics,Clique,Vertex (geometry),Enumeration,Induced subgraph,Time complexity,Real number,Mathematics,Bounded function | Journal |
Volume | Issue | ISSN |
5 | 4 | 1549-6325 |
Citations | PageRank | References |
18 | 0.93 | 14 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hiro Ito | 1 | 290 | 39.95 |
| Kazuo Iwama | 2 | 1400 | 153.38 |