Abstract
Every connected graph on n vertices has a cut of size at least \(n-1\). We call this bound the ‘spanning tree bound’. In the Max-Cut Above Spanning Tree (Max-Cut-AST) problem, we are given a connected n-vertex graph G and a non-negative integer k, and the task is to decide whether G has a cut of size at least \(n-1+k\). We show that Max-Cut-AST admits an algorithm that runs in time \(\mathcal {O}(8^kn^{\mathcal {O}(1)})\), and hence it is fixed parameter tractable with respect to k. Furthermore, we show that Max-Cut-AST has a polynomial kernel of size \(\mathcal {O}(k^5)\).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Cai, L., Juedes, D.W.: On the existence of subexponential parameterized algorithms. J. Comput. Syst. Sci. 67(4), 789–807 (2003)
Crowston, R., Jones, M., Mnich, M.: Max-Cut parameterized above the Edwards-Erdős bound. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012. LNCS, vol. 7391, pp. 242–253. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-31594-7_21
Crowston, R., Jones, M., Mnich, M.: Max-Cut parameterized above the Edwards-Erdős bound. Algorithmica 72(3), 734–757 (2015)
Edwards, C.S.: An improved lower bound for the number of edges in a largest bipartite subgraph. In: Proceedings of the 2nd Czechoslovak Symposium on Graph Theory, Prague, pp. 167–181 (1975)
Edwards, C.: Some extremal properties of bipartite subgraphs. Can. J. Math. 25(3), 475–483 (1973)
Erdös, P.: On some extremal problems in graph theory. Isr. J. Math. 3(2), 113–116 (1965)
Etscheid, M., Mnich, M.: Linear kernels and linear-time algorithms for finding large cuts. In: 27th International Symposium on Algorithms and Computation, ISAAC 2016, Sydney, Australia, 12–14 December 2016, pp. 31:1–31:13 (2016)
Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations. IRSS, pp. 85–103. Springer, Boston (1972). https://doi.org/10.1007/978-1-4684-2001-2_9
Mahajan, M., Raman, V.: Parameterizing above guaranteed values: MaxSat and MaxCut. J. Algorithms 31(2), 335–354 (1999)
Mnich, M., Philip, G., Saurabh, S., Suchý, O.: Beyond Max-Cut: \(\lambda \)-extendible properties parameterized above the Poljak-Turzík bound. J. Comput. Syst. Sci. 80(7), 1384–1403 (2014)
Poljak, S., Tuza, Z.: Maximum cuts and largest bipartite subgraphs. In: Proceedings of a DIMACS Workshop on Combinatorial Optimization, New Brunswick, New Jersey, USA, 1992/1993, pp. 181–244 (1993)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Madathil, J., Saurabh, S., Zehavi, M. (2018). Max-Cut Above Spanning Tree is Fixed-Parameter Tractable. In: Fomin, F., Podolskii, V. (eds) Computer Science – Theory and Applications. CSR 2018. Lecture Notes in Computer Science(), vol 10846. Springer, Cham. https://doi.org/10.1007/978-3-319-90530-3_21
Download citation
DOI: https://doi.org/10.1007/978-3-319-90530-3_21
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-90529-7
Online ISBN: 978-3-319-90530-3
eBook Packages: Computer ScienceComputer Science (R0)