Finding dense subgraphs

  • Yuichi Asahiro
  • Kazuo Iwama
Session 3B
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1004)


The dense subgraph problem (DSG) asks, given a graph G and two integers K1 and K2, whether there is a subgraph of G which has at most K1 vertices and at least K2 edges. When K2=K1(K1−1)/2, DSG is equivalent to well-known CLIQUE. The main purpose of this paper is to discuss the problem of finding slightly dense subgraphs. It is shown that DSG remains NP-complete for the set of instances (G, K1, K2) such that K1s/2, K2K 1 1+ε and K2e/4(1+9/20+o(1)), where s is the number of G's vertices and e is the number of G's edges. If the second restriction is removed, then the third restriction can be strengthened, i.e., DSG is NP-complete for K1=s/2 and K2e/4(1+O(1/√s)). The condition for K2 is quite tight because the answer to DSG is always yes for K1=s/2 and k2e/4(1−O(1/s)). Furthermore there is a deterministic polynomial-time algorithm that finds a subgraph of this density.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AIM95]
    Y. Asahiro, K. Iwama and E. Miyano. Random Generation of Test Instances with Controlled Attributes. DIMA CS Series in Discrete Math. and Theor. Comput. Sci., 1995 (in press).Google Scholar
  2. [ASE92]
    N. Alon, J. H. Spencer and P. Erdös. The probabilistic method. J.Wiley, 1992.Google Scholar
  3. [Coo71]
    S. A. Cook. The complexity of theorem-proving procedures. In Proc. 3rd Ann. ACM STOC, pp.151–158, 1971.Google Scholar
  4. [EIS76]
    S. Even, A. Itai and A. Shamir. On the complexity of timetable and multicommodity flow problems. SIAM J. Comput., Vol.5, pp.691–703, 1976.Google Scholar
  5. [GJS76]
    M. R. Garey, D. S. Johnson and L. Stockmeyer. Some simplified NP-complete graph problems, Theor. Comput. Sci. Vol.1, pp.237–267, 1976.Google Scholar
  6. [Had75]
    F. O. Hadlock. Finding a maximum cut of a planar graph in polynomial time. SIAM J. Comput., Vol.4, pp.221–225, 1975.Google Scholar
  7. [IM95]
    K. Iwama and E. Miyano. Intractability of read-once resolution. In Proc. 10th IEEE Structure in Complexity Conference, 1995.Google Scholar
  8. [Kar72]
    R. M. Karp. Reducibility among combinatorial problems. Complexity of Computer Computations, Plenum Press, N.Y., pp.85–103, 1972.Google Scholar
  9. [OD72]
    G. I. Orlova and Y. G. Dorfman. Finding the maximum cut in a graph. Engrg. Cybernetics, Vol.10, pp.502–506, 1972.Google Scholar
  10. [Tok95]
    T. Tokuyama, personal communication, 1995.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Yuichi Asahiro
    • 1
  • Kazuo Iwama
    • 1
  1. 1.Department of Computer Scíence and Communication EngineeringKyushu UniversityFukuokaJapan

Personalised recommendations