Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems

  • Sushmita Gupta
  • Venkatesh Raman
  • Saket Saurabh
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4337)


Given a graph G = (V,E) on n vertices, the Maximum r -Regular Induced Subgraph (M- r -RIS) problems ask for a maximum sized subset of vertices R ⊆ V such that the induced subgraph on R, G[R], is r-regular. We give an \(\mathcal{O}(c^n)\) time algorithm for these problems for any fixed constant r, where c is a positive constant strictly less than 2, solving a well known open problem. These algorithms are then generalized to solve counting and enumeration version of these problems in the same time. An interesting consequence of the enumeration algorithm is, that it shows that the number of maximal r-regular induced subgraphs for a fixed constant r on any graph on n vertices is upper bounded by o(2 n ).

We then give combinatorial lower bounds on the number of maximalr-regular induced subgraphs possible on a graph on n vertices and also give matching algorithmic upper bounds.

We use the techniques and results obtained in the paper to obtain an improved exact algorithm for a special case of Induced Subgraph Isomorphism that is Induced r -Regular Subgraph Isomorphism, where r is a constant.

All the algorithms in the paper are simple but their analyses are not. Some of the upper bound proofs or algorithms require a new and different measure than the usual number of vertices or edges to measure the progress of the algorithm, and require solving an interesting system of polynomials.


Exact Algorithm Isomorphism Problem Subgraph Isomorphism Induce Subgraph Unique Neighbor 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Babai, L., Kantor, W.M., Luks, E.M.: Computational Complexity and the Classification of Finite Simple Groups. In: Proceedings of FOCS 1983, pp. 162–171 (1983)Google Scholar
  2. 2.
    Bonifaci, V., Di Iorio, U., Laura, L.: On the Complexity of Uniformly Mixed Nash Equilibria and Related Regular Subgraph Problems. In: Liśkiewicz, M., Reischuk, R. (eds.) FCT 2005. LNCS, vol. 3623, pp. 197–208. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  3. 3.
    Byskov, J.M.: Enumerating Maximal Independent Sets with Applications to Graph Colouring. Operations Research Letters 32(6), 547–556 (2004)MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Cameron, K.: Induced Matchings. Discrete Applied Mathematics 24, 97–102 (1989)MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Cardoso, D.M., Kaminski, M., Lozin, V.: Maximum k-Regular Induced Subgraphs. Rutcor Research Report (RRR) 3 (2006)Google Scholar
  6. 6.
    Fomin, F.V., Gaspers, S., Pyatkin, A.V.: Finding a Minimum Feedback Vertex Set in Time \(\mathcal{O} (1.7548^n)\). In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 184–191. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  7. 7.
    Fomin, F.V., Grandoni, F., Kratsch, D.: Measure and Conquer: A Simple O(20.288n) Independent Set Algorithm. In: Proceedings of SODA 2006, pp. 18–25 (2006)Google Scholar
  8. 8.
    Fomin, F.V., Grandoni, F., Kratsch, D.: Some new techniques in design and analysis of exact (exponential) algorithms. Bulletin of the EATCS 87, 47–77 (2005)MATHMathSciNetGoogle Scholar
  9. 9.
    Garey, M.R., Johnson, D.S.: Computer and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco (1979)Google Scholar
  10. 10.
    Georges, J.P., Halsey, M.D., Sanaulla, A.M., Whittlesey, M.A.: Edge Domination and Graph Structure. Cong. Numer. 76, 127–144 (1990)MATHMathSciNetGoogle Scholar
  11. 11.
    Luks, E.M.: Isomorphism of Graphs of Bounded Valence can be Tested in Polynomial Time. Journal of Computer System Sciences 25(1), 42–65 (1982)MATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Moon, J.W., Moser, L.: On Cliques in Graphs. Israel Journal of Mathematics 3, 23–28 (1965)MATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Raman, V., Saurabh, S., Sikdar, S.: Efficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques. Theory of Computing Systems (to appear)Google Scholar
  14. 14.
    Razgon, I.: Exact Computation of Maximum Induced Forest. In: Arge, L., Freivalds, R. (eds.) SWAT 2006. LNCS, vol. 4059, pp. 160–171. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  15. 15.
    Robson, J.M.: Algorithms for Maximum Independent Set. Journal of Algorithms 7, 425–440 (1986)MATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    Steger, A., Yu, M.: On Induced Matchings. Discrete Mathematics 120, 291–295 (1993)MATHCrossRefMathSciNetGoogle Scholar
  17. 17.
    Stockmeyer, L.J., Vazirani, V.V.: NP-Completeness of Some Generalizations of the Maximum Matching Problem. Information Processing Letters 15(1), 14–19 (1982)MATHCrossRefMathSciNetGoogle Scholar
  18. 18.
    Woeginger, G.: Exact algorithms for NP-hard problems: A survey. In: Jünger, M., Reinelt, G., Rinaldi, G. (eds.) Combinatorial Optimization - Eureka, You Shrink!, vol. 2570, pp. 185–207. Springer, Heidelberg (2003)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Sushmita Gupta
    • 1
  • Venkatesh Raman
    • 2
  • Saket Saurabh
    • 2
  1. 1.Department of Computer ScienceSimon Fraser UniversityCanada
  2. 2.The Institute of Mathematical SciencesChennaiIndia

Personalised recommendations