Abstract
The girth of a directed graph is the length of its shortest directed cycle. We consider the problem of generating all subgraphs of girth at least g in a directed graph G with n vertices and m edges. This generalizes the problem of generating acyclic subgraphs (i.e., with no directed cycle), that correspond to the subgraphs of girth at least \(n+1\). The problem of finding the acyclic subgraph with maximum size or weight has been thoroughly studied, however to the best of our knowledge there is no known efficient enumeration algorithm. We propose polynomial delay algorithms for listing both induced and edge subgraphs with girth g in time O(n) per solution; both improve upon a naive solution, respectively by a factor O(nm) and \(O(m^2)\). Furthermore, this work is on the line of existing research for extracting acyclic structures from graphs.
This work was supported by JST CREST, Grant Number JPMJCR1401, Japan.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
This is different in the weighted case, in which distances can be reduced by less than 1, and will thus require using \(O(n^2m)\) space.
References
Berger, B., Shor, P.W.: Approximation algorithms for the maximum acyclic subgraph problem. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 236–243 (1990)
Borodin, O.V., Kim, S.-J., Kostochka, A.V., West, D.B.: Homomorphisms from sparse graphs with large girth. J. Comb. Theory Ser. B 90(1), 147–159 (2004)
Chandran, L.S., Subramanian, C.R.: Girth and treewidth. J. Comb. Theory Ser. B 93(1), 23–32 (2005)
Chang, H.-C., Lu, H.-I.: Computing the girth of a planar graph in linear time. SIAM J. Comput. 42(3), 1077–1094 (2013)
Conte, A., Grossi, R., Marino, A., Rizzi, R.: Listing acyclic orientations of graphs with single and multiple sources. In: Kranakis, E., Navarro, G., Chávez, E. (eds.) LATIN 2016. LNCS, vol. 9644, pp. 319–333. Springer, Heidelberg (2016). https://doi.org/10.1007/978-3-662-49529-2_24
Cook, R.J.: Chromatic number and girth. Periodica Mathematica Hungarica 6(1), 103–107 (1975)
Diestel, R.: Graph Theory. Graduate Texts in Mathematics, 4th edn. Springer, Heidelberg (2017)
Djidjev, H.: Computing the girth of a planar graph. In: 27th International Colloquium on Automata, Languages and Programming, pp. 821–831 (2000)
Galluccio, A., Goddyn, L.A., Hell, P.: High-girth graphs avoiding a minor are nearly bipartite. J. Comb. Theory Ser. B 83(1), 1–14 (2001)
Grötschel, M., Jünger, M., Reinelt, G.: On the acyclic subgraph polytope. Math. Prog. 33(1), 28–42 (1985)
Hayes, T.P.: Randomly coloring graphs of girth at least five. In: ACM Symposium on Theory of Computing, pp. 269–278. ACM (2003)
Itai, A., Rodeh, M.: Finding a minimum circuit in a graph. SIAM J. Comput. 7(4), 413–423 (1978)
Johnson, D.S., Yannakakis, M., Papadimitriou, C.H.: On generating all maximal independent sets. Inf. Process. Lett. 27(3), 119–123 (1988)
Orlin, J.B., Sedeno-Noda, A.: An o(nm) time algorithm for finding the min length directed cycle in a graph. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 1866–1879 (2017)
Pettie, S.: A new approach to all-pairs shortest paths on real-weighted graphs. Theor. Comput. Sci. 312(1), 47–74 (2004)
Raman, V., Saurabh, S.: Short cycles make W-hard problems hard: FPT algorithms for W-hard problems in graphs with no short cycles. Algorithmica 52(2), 203–225 (2008)
Squire, M.B.: Generating the acyclic orientations of a graph. J. Algorithms 26(2), 275–290 (1998)
Thomassen, C.: 3-list-coloring planar graphs of girth 5. J. Comb. Theory Ser. B 64(1), 101–107 (1995)
Uno, T.: Two general methods to reduce delay and change of enumeration algorithms. NII Technical Report NII-2003-004E, Tokyo, Japan (2003)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Conte, A., Kurita, K., Wasa, K., Uno, T. (2017). Listing Acyclic Subgraphs and Subgraphs of Bounded Girth in Directed Graphs. In: Gao, X., Du, H., Han, M. (eds) Combinatorial Optimization and Applications. COCOA 2017. Lecture Notes in Computer Science(), vol 10628. Springer, Cham. https://doi.org/10.1007/978-3-319-71147-8_12
Download citation
DOI: https://doi.org/10.1007/978-3-319-71147-8_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-71146-1
Online ISBN: 978-3-319-71147-8
eBook Packages: Computer ScienceComputer Science (R0)