Abstract
In this paper, we address the problem of enumerating all induced subtrees in an input \(k\) -degenerate graph, where an induced subtree is an acyclic and connected induced subgraph. A graph \(G = (V, E)\) is a \(k\)-degenerate graph if for any its induced subgraph has a vertex whose degree is less than or equal to \(k\), and many real-world graphs have small degeneracies, or very close to small degeneracies. Although, the studies are on subgraphs enumeration, such as trees, paths, and matchings, but the problem addresses the subgraph enumeration, such as enumeration of subgraphs that are trees. Their induced subgraph versions have not been studied well. One of few examples is for chordless paths and cycles. Our motivation is to reduce the time complexity close to \(O(1)\) for each solution. This type of optimal algorithms is proposed many subgraph classes such as trees, and spanning trees. Induced subtrees are fundamental object thus it should be studied deeply and there possibly exist some efficient algorithms. Our algorithm utilizes nice properties of \(k\)-degeneracy to state an effective amortized analysis. As a result, the time complexity is reduced to \(O(k)\) time per induced subtree. The problem is solved in constant time for each in planar graphs, as a corollary.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Avis, D., Fukuda, K.: Reverse search for enumeration. DAM 65, 21–46 (1996)
Birmelé, E., Ferreira, R.A., Grossi, R., Marino, A., Pisanti, N., Rizzi, R., Sacomoto, G.: Optimal Listing of Cycles and st-Paths in Undirected Graphs. In: Proc. SODA 2013, pp. 1884–1896 (2013)
Ferreira, R., Grossi, R., Rizzi, R.: Output-sensitive listing of bounded-size trees in undirected graphs. In: Demetrescu, C., Halldórsson, M.M. (eds.) ESA 2011. LNCS, vol. 6942, pp. 275–286. Springer, Heidelberg (2011)
Ferreira, R., Grossi, R., Rizzi, R., Sacomoto, G., Sagot, M.-F.: Amortized \(\tilde{O}(|V|)\)-Delay Algorithm for Listing Chordless Cycles in Undirected Graphs. In: Schulz, A.S., Wagner, D. (eds.) ESA 2014. LNCS, vol. 8737, pp. 418–429. Springer, Heidelberg (2014)
Lick, D.R., White, A.T.: \(k\)-degenerate graphs. Can. J. Math. XXII(5), 1082–1096 (1970)
Matula, D.W., Beck, L.L.: Smallest-last ordering and clustering and graph coloring algorithms. J. ACM 30(3), 417–427 (1983)
Shioura, A., Tamura, A., Uno, T.: An optimal algorithm for scanning all spanning trees of undirected graphs. SIAM J. Comput. 26(3), 678–692 (1997)
Tarjan, R.E.: Enumeration of the Elementary Circuits of a Directed Graph. SIAM J. Comput. 2(3), 211–216 (1973)
Tarjan, R.E., Read, R.C.: Bounds on backtrack algorithms for listing cycles, paths, and spanning trees. Networks 5(3), 237–252 (1975)
Uno, T.: An output linear time algorithm for enumerating chordless cycles. Technical Notes, 92nd SIGAL of IPSJ, pp. 47–53 (2003) (in Japanese)
Wasa, K., Kaneta, Y., Uno, T., Arimura, H.: Constant time enumeration of bounded-size subtrees in trees and its application. In: Gudmundsson, J., Mestre, J., Viglas, T. (eds.) COCOON 2012. LNCS, vol. 7434, pp. 347–359. Springer, Heidelberg (2012)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Wasa, K., Arimura, H., Uno, T. (2014). Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph. In: Ahn, HK., Shin, CS. (eds) Algorithms and Computation. ISAAC 2014. Lecture Notes in Computer Science(), vol 8889. Springer, Cham. https://doi.org/10.1007/978-3-319-13075-0_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-13075-0_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-13074-3
Online ISBN: 978-3-319-13075-0
eBook Packages: Computer ScienceComputer Science (R0)