Abstract
We consider the well studied Full Degree Spanning Tree problem, a NP-complete variant of the Spanning Tree problem, in the realm of moderately exponential time exact algorithms. In this problem, given a graph G, the objective is to find a spanning tree T of G which maximizes the number of vertices that have the same degree in T as in G. This problem is motivated by its application in fluid networks and is basically a graph-theoretic abstraction of the problem of placing flow meters in fluid networks. We give an exact algorithm for Full Degree Spanning Tree running in time \({\mathcal{O}(1.9172^n)}\). This adds Full Degree Spanning Tree to a very small list of “non-local problems”, like Feedback Vertex Set and Connected Dominating Set, for which non-trivial (non brute force enumeration) exact algorithms are known.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bhatia, R., Khuller, S., Pless, R., Sussmann, Y.J.: The full degree spanning tree problem. Networks 36(4), 203–209 (2000)
Björklund, A., Husfeldt, T.: Inclusion–Exclusion Algorithms for Counting Set Partitions. In: The proceedings of FOCS 2006, pp. 575–582 (2006)
Björklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Fourier meets Möbius: Fast Subset Convolution. In: The proceedings of STOC 2007, pp. 67–74 (2007)
Broersma, H., Koppius, O.R., Tuinstra, H., Huck, A., Kloks, T., Kratsch, D., Müller, H.: Degree-preserving trees. Networks 35(1), 26–39 (2000)
Christofides, N.: An Algorithm for the Chromatic Number of a Graph. Computer Journal 14(1), 38–39 (1971)
Fomin, F.V., Gaspers, S., Pyatkin, A.V.: Finding a Minimum Feedback Vertex Set in Time O(1.7548n). 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: Domination - A Case Study. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 191–203. Springer, Heidelberg (2005)
Fomin, F.V., Grandoni, F., Kratsch, D.: Measure and Conquer: A simple O(20.288n) Independent Set Algorithm. In: The proceedings of SODA 2006, pp. 18–25 (2006)
Fomin, F.V., Grandoni, F., Kratsch, D.: Solving Connected Dominating Set Faster Than 2n. In: Arun-Kumar, S., Garg, N. (eds.) FSTTCS 2006. LNCS, vol. 4337, pp. 152–163. Springer, Heidelberg (2006)
Guo, J., Niedermeier, R., Wernicke, S.: Fixed-Parameter Tractability Results for Full-Degree Spanning Tree and Its Dual. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 203–214. Springer, Heidelberg (2006)
Khuller, S., Bhatia, R., Pless, R.: On Local Search and Placement of Meters in Networks. SIAM Journal of Computing 32(2), 470–487 (2003)
Koivisto, M.: An O(2n) Algorithm for Graph Colouring and Other Partitioning Problems via Inclusion-Exclusion. In: The proceedings of FOCS 2006, pp. 583–590 (2006)
Kruskal, J.B.: On the Shortest Spanning Subtree and the Traveling Salesman Problem. The proceedings of the American Mathematical Society 7, 48–50 (1956)
Lawler, E.L.: A Note on the Complexity of the Chromatic Number Problem. Information Processing Letters 5(3), 66–67 (1976)
Lewinter, M.: Interpolation Theorem for the Number of Degree-Preserving Vertices of Spanning Trees. IEEE Transaction Circ. Syst. 34, 205 (1987)
Ormsbee, L.E.: Implicit Network Calibration, Journal of Water Resources. Planning and Management 115(2), 243–257 (1989)
Ormsbee, L.E., Wood, D.J.: Explicit Pipe Network Calibratio. Journal of Water Resources, Planning and Management 112(2), 166–182 (1986)
Pothof, I.W.M., Schut, J.: Graph-theoretic approach to identifiability in a water distribution network. Memorandum, vol. 1283, Universiteit Twent (1995)
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)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gaspers, S., Saurabh, S., Stepanov, A.A. (2008). A Moderately Exponential Time Algorithm for Full Degree Spanning Tree. In: Agrawal, M., Du, D., Duan, Z., Li, A. (eds) Theory and Applications of Models of Computation. TAMC 2008. Lecture Notes in Computer Science, vol 4978. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79228-4_42
Download citation
DOI: https://doi.org/10.1007/978-3-540-79228-4_42
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-79227-7
Online ISBN: 978-3-540-79228-4
eBook Packages: Computer ScienceComputer Science (R0)