Abstract
For a finite, simple, undirected graph G and an integer d ≥ 1, a mindeg-d subgraph is a subgraph of G of minimum degree at least d. The d-girth of G, denoted g d (G), is the minimum size of a mindeg-d subgraph of G. It is a natural generalization of the usual girth, which coincides with the 2-girth. The notion of d-girth was proposed by Erdős et al. [13, 14] and Bollobás and Brightwell [7] over 20 years ago, and studied from a purely combinatorial point of view. Since then, no new insights have appeared in the literature. Recently, first algorithmic studies of the problem have been carried out [2,4]. The current article further explores the complexity of finding a small mindeg-d subgraph of a given graph (that is, approximating its d-girth), by providing new hardness results and the first approximation algorithms in general graphs, as well as analyzing the case where G is planar.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Addario-Berry, L., Dalal, K., Reed, B.A.: Degree constrained subgraphs. Discrete Applied Mathematics 156(7), 1168–1174 (2008)
Amini, O., Peleg, D., Pérennes, S., Sau, I., Saurabh, S.: Degree-Constrained Subgraph Problems: Hardness and Approximation Results. In: Bampis, E., Skutella, M. (eds.) ALGO/WAOA 2008. LNCS, vol. 5426, pp. 29–42. Springer, Heidelberg (2009), www.cs.technion.ac.il/~ignasi/Pubs/APP+10.pdf
Amini, O., Pérennes, S., Sau, I.: Hardness and Approximation of Traffic Grooming. Theoretical Computer Science 410(38-40), 3751–3760 (2009)
Amini, O., Sau, I., Saurabh, S.: Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem. In: Grohe, M., Niedermeier, R. (eds.) IWPEC 2008. LNCS, vol. 5018, pp. 13–29. Springer, Heidelberg (2008), www.cs.technion.ac.il/~ignasi/Pubs/ASS10.pdf
Baker, B.S.: Approximation Algorithms for NP-Complete Problems on Planar Graphs. Journal of the ACM 41(1), 153–180 (1994)
Bermond, J.-C., Peyrat, C.: Induced Subgraphs of the Power of a Cycle. SIAM Journal on Discrete Mathematics 2(4), 452–455 (1989)
Bollobás, B., Brightwell, G.: Long Cycles in Graphs with no Subgraphs of Minimal Degree 3. Discrete Mathematics 75, 47–53 (1989)
Cheriyan, J., Thurimella, R.: Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching (extended abstract). In: Proc. of the 37th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 292–301 (1996)
Chow, T., Lin, P.J.: The ring grooming problem. Networks 44, 194–202 (2004)
Diestel, R.: Graph Theory, vol. 173. Springer, Heidelberg (2005)
Dorn, F.: Planar Subgraph Isomorphism Revisited. In: Proc. of the 27th International Symposium on Theoretical Aspects of Computer Science (STACS). LIPIcs, vol. 5, pp. 263–274 (2010)
Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
Erdős, P., Faudree, R.J., Gyárfás, A., Schelp, R.H.: Cycles in Graphs Without Proper Subgraphs of Minimum Degree 3. Ars Combinatorica 25(B), 195–201 (1988)
Erdős, P., Faudree, R.J., Rousseau, C.C., Schelp, R.H.: Subgraphs of Minimal Degree k. Discrete Mathematics 85(1), 53–58 (1990)
Gabow, H.N.: An Efficient Reduction Technique for Degree-Constrained Subgraph and Bidirected Network Flow Problems. In: Proc. of the 15th Annual ACM Symposium on Theory of Computing (STOC), pp. 448–456 (1983)
Garey, M.R., Johnson, D.S.: The Rectilinear Steiner Tree Problem is NP-Complete. SIAM Journal on Applied Mathematics 32(4), 826–834 (1977)
Karger, D., Motwani, R., Ramkumar, G.: On Approximating the Longest Path in a Graph. Algorithmica 18(1), 82–98 (1997)
Kézdy, A.: Studies in Connectivity. PhD thesis, Univ. of Illinois, Urbana-Champaign (1991)
Li, Z., Nakano, S.-I.: Efficient generation of plane triangulations without repetitions. In: Yu, Y., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 433–443. Springer, Heidelberg (2001)
Lipton, R.J., Tarjan, R.E.: A separator theorem for planar graphs. SIAM Journal on Applied Mathematics 36, 177–189 (1979)
Nutov, Z.: Approximating Directed Weighted-Degree Constrained Networks. In: Goel, A., Jansen, K., Rolim, J.D.P., Rubinfeld, R. (eds.) APPROX and RANDOM 2008. LNCS, vol. 5171, pp. 219–232. Springer, Heidelberg (2008)
Peleg, D., Sau, I., Shalom, M.: On approximating the d-girth of a graph (manuscript), www.lirmm.fr/~au/Pubs/d-girth.pdf
Safari, M., Salavatipour, M.R.: A Constant Factor Approximation for Minimum λ-Edge-Connected k-Subgraph with Metric Costs. In: Goel, A., Jansen, K., Rolim, J.D.P., Rubinfeld, R. (eds.) APPROX and RANDOM 2008. LNCS, vol. 5171, pp. 233–246. Springer, Heidelberg (2008)
Tutte, W.T.: A census of planar triangulations. Canadian Journal of Mathematics 14, 21–38 (1962)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Peleg, D., Sau, I., Shalom, M. (2011). On Approximating the d-Girth of a Graph. In: Černá, I., et al. SOFSEM 2011: Theory and Practice of Computer Science. SOFSEM 2011. Lecture Notes in Computer Science, vol 6543. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18381-2_39
Download citation
DOI: https://doi.org/10.1007/978-3-642-18381-2_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-18380-5
Online ISBN: 978-3-642-18381-2
eBook Packages: Computer ScienceComputer Science (R0)