Abstract
A lineal topology \(\mathcal {T} = (G, r, T)\) of a graph G is an r-rooted depth-first spanning (DFS) tree T of G. Equivalently, this is a spanning tree of G such that every edge uv of G is either an edge of T or is between a vertex u and an ancestor v on the unique path in T from u to r. We consider the parameterized complexity of finding a lineal topology that satisfies upper or lower bounds on the number of leaves of T, parameterized by the bound. This immediately yields four natural parameterized problems: (i) \(\le k\) leaves, (ii) \(\ge k\) leaves, (iii) \(\le n-k\) leaves, and (iv) \(\ge n-k\) leaves, where \(n=|G|\). We show that all four problems are NP-hard, considered classically. We show that (i) is para-NP-hard, (ii) is hard for W[1], (iii) is FPT, and (iv) is FPT. Our work is motivated by possible applications in graph drawing and visualization.
Supported by Research Council of Norway (NFR, no. 274526 and 314528).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bodlaender, H.: On linear time minor tests with depth-first search. J. Algorithms 14(1), 1–23 (1993)
Bonsma, P.S., Brueggemann, T., Woeginger, G.J.: A faster FPT algorithm for finding spanning trees with many leaves. In: Rovan, B., Vojtáš, P. (eds.) MFCS 2003. LNCS, vol. 2747, pp. 259–268. Springer, Heidelberg (2003). https://doi.org/10.1007/978-3-540-45138-9_20
Chinn, P.Z., Chvátalová, J., Dewdney, A.K., Gibbs, N.E.: The bandwidth problem for graphs and matrices-a survey. J. Graph Theory 6(3), 223–254 (1982)
Courcelle, B.: The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Inf. Comput. 85(1), 12–75 (1990)
Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput. Syst. 33(2), 125–150 (2000). https://doi.org/10.1007/s002249910009
Courcelle, P.B., Engelfriet, D.J.: Graph Structure and Monadic Second-Order Logic: A Language-Theoretic Approach, 1st edn. Cambridge University Press, Cambridge (2012)
Cygan, M., et al.: Parameterized Algorithms, 1st edn. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-21275-3
De Fraysseix, H.: Trémaux trees and planarity. Electron. Notes Discrete Math. 31, 169–180 (2008)
De Fraysseix, H., De Mendez, P.O., Rosenstiehl, P.: Trémaux trees and planarity. Int. J. Found. Comput. Sci. 17(05), 1017–1029 (2006)
de Fraysseix, H., de Mendez, P.O.: Trémaux trees and planarity. Eur. J. Comb. 33(3), 279–293 (2012). Topological and Geometric Graph Theory
Diestel, R.: Graph Theory, 5th edn. Springer, Heidelberg (2017). https://doi.org/10.1007/978-3-662-53622-3
Diestel, R., Leader, I.: Normal spanning trees, Aronszajn trees and excluded minors. J. Lond. Math. Soc. 63(1), 16–32 (2001)
Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness I: basic results. SIAM J. Comput. 24(4), 873–921 (1995)
Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Springer, London (2013). https://doi.org/10.1007/978-1-4471-5559-1
Even, S., Tarjan, R.E.: Network flow and testing graph connectivity. SIAM J. Comput. 4(4), 507–518 (1975)
Fellows, M.R., Langston, M.A.: On search decision and the efficiency of polynomial-time algorithms. In: Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, STOC 1989, pp. 501–512. Association for Computing Machinery, New York (1989). https://doi.org/10.1145/73007.73055
Fellows, M.R., Friesen, D.K., Langston, M.A.: On finding optimal and near-optimal lineal spanning trees. Algorithmica 3(1–4), 549–560 (1988). https://doi.org/10.1007/BF01762131
Fellows, M.R., Rosamond, F.A.: Collaborating with Hans: some remaining wonderments. In: Fomin, F.V., Kratsch, S., van Leeuwen, E.J. (eds.) Treewidth, Kernels, and Algorithms. LNCS, vol. 12160, pp. 7–17. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-42071-0_2
de Fraysseix, H., Rosenstiehl, P.: A characterization of planar graphs by Trémaux orders. Combinatorica 5(2), 127–135 (1985). https://doi.org/10.1007/BF02579375
Garey, M.R., Johnson, D.S.: Crossing number is NP-complete. SIAM J. Algebraic Discrete Methods 4(3), 312–316 (1983). https://doi.org/10.1137/0604033
Hopcroft, J., Tarjan, R.: Algorithm 447: efficient algorithms for graph manipulation. Commun. ACM 16(6), 372–378 (1973)
Hopcroft, J., Tarjan, R.: Efficient planarity testing. J. ACM (JACM) 21(4), 549–568 (1974)
Hopcroft, J.E., Karp, R.M.: An \(n^{5/2}\) algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2(4), 225–231 (1973)
Libkin, L.: Elements of Finite Model Theory. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-662-07003-1
Nešetřil, J., de Mendez, P.O.: Bounded height trees and tree-depth. In: Nešetřil, J., de Mendez, P.O. (eds.) Sparsity. AC, vol. 28, pp. 115–144. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-27875-4_6
Ozeki, K., Yamashita, T.: Spanning trees: a survey. Graphs Comb. 27, 1–26 (2011). https://doi.org/10.1007/s00373-010-0973-2
Prieto, E., Sloper, C.: Either/Or: using Vertex Cover structure in designing FPT-algorithms—the case of k-Internal Spanning Tree. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol. 2748, pp. 474–483. Springer, Heidelberg (2003). https://doi.org/10.1007/978-3-540-45078-8_41
Rosamond, F.: Max leaf spanning tree. In: Kao, M.Y. (ed.) Encyclopedia of Algorithms, pp. 1211–1215. Springer, New York (2016). https://doi.org/10.1007/978-1-4939-2864-4_228
Williamson, S.: Combinatorics for Computer Science. Dover Books on Mathematics. Dover Publications (2002). https://books.google.no/books?id=YMIoy5JwdHMC
Acknowledgement
We acknowledge support from the Research Council of Norway (NFR, no. 274526 and 314528). We also thank Nello Blaser and Benjamin Bergougnoux for helping to review the initial versions of the paper.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Sam, E., Fellows, M., Rosamond, F., Golovach, P.A. (2023). On the Parameterized Complexity of the Structure of Lineal Topologies (Depth-First Spanning Trees) of Finite Graphs: The Number of Leaves. In: Mavronicolas, M. (eds) Algorithms and Complexity. CIAC 2023. Lecture Notes in Computer Science, vol 13898. Springer, Cham. https://doi.org/10.1007/978-3-031-30448-4_25
Download citation
DOI: https://doi.org/10.1007/978-3-031-30448-4_25
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-30447-7
Online ISBN: 978-3-031-30448-4
eBook Packages: Computer ScienceComputer Science (R0)