Abstract
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(2n).
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
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)
Byskov, J.M.: Enumerating Maximal Independent Sets with Applications to Graph Colouring. Operations Research Letters 32(6), 547–556 (2004)
Cameron, K.: Induced Matchings. Discrete Applied Mathematics 24, 97–102 (1989)
Cardoso, D.M., Kaminski, M., Lozin, V.: Maximum k-Regular Induced Subgraphs. Rutcor Research Report (RRR) 3 (2006)
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)
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)
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)
Garey, M.R., Johnson, D.S.: Computer and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco (1979)
Georges, J.P., Halsey, M.D., Sanaulla, A.M., Whittlesey, M.A.: Edge Domination and Graph Structure. Cong. Numer. 76, 127–144 (1990)
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)
Moon, J.W., Moser, L.: On Cliques in Graphs. Israel Journal of Mathematics 3, 23–28 (1965)
Raman, V., Saurabh, S., Sikdar, S.: Efficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques. Theory of Computing Systems (to appear)
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)
Robson, J.M.: Algorithms for Maximum Independent Set. Journal of Algorithms 7, 425–440 (1986)
Steger, A., Yu, M.: On Induced Matchings. Discrete Mathematics 120, 291–295 (1993)
Stockmeyer, L.J., Vazirani, V.V.: NP-Completeness of Some Generalizations of the Maximum Matching Problem. Information Processing Letters 15(1), 14–19 (1982)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gupta, S., Raman, V., Saurabh, S. (2006). Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems. In: Arun-Kumar, S., Garg, N. (eds) FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2006. Lecture Notes in Computer Science, vol 4337. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11944836_15
Download citation
DOI: https://doi.org/10.1007/11944836_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49994-7
Online ISBN: 978-3-540-49995-4
eBook Packages: Computer ScienceComputer Science (R0)