Max-Cut Parameterized above the Edwards-Erdős Bound-Reference-Cited by-同舟云学术

Max-Cut Parameterized above the Edwards-Erdős Bound

Published:2012 Issue: Volume: Page:242-253
ISSN:0302-9743
Container-title:Automata, Languages, and Programming
language:
Short-container-title:

Author:

Crowston Robert,Jones Mark,Mnich Matthias

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-31594-7_21.pdf

Reference27 articles.

1. Alon, N.: Bipartite subgraphs. Combinatorica 16(3), 301–311 (1996)

2. Andersen, L.D., Grant, D.D., Linial, N.: Extremal k-colourable subgraphs. Ars Combin. 16, 259–270 (1983)

3. Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On problems without polynomial kernels. J. Comput. System Sci. 75(8), 423–434 (2009)

4. Bollobás, B., Scott, A.: Better bounds for Max Cut. In: Bollobás, B. (ed.) Contemporary Combinatorics. Bolyai Society Mathematical Studies, vol. 10, pp. 185–246 (2002)

5. Cai, L., Juedes, D.: On the existence of subexponential parameterized algorithms. J. Comput. System Sci. 67(4), 789–807 (2003)

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Fixed-Parameter Tractable Algorithm and Polynomial Kernel for Max-Cut Above Spanning Tree;Theory of Computing Systems;2019-02-18

2. Max-Cut Above Spanning Tree is Fixed-Parameter Tractable;Computer Science – Theory and Applications;2018

3. Parameterized Traveling Salesman Problem: Beating the Average;SIAM Journal on Discrete Mathematics;2016-01

4. Kernelization, Max-Cut Above Tight Bounds;Encyclopedia of Algorithms;2016

5. Large Independent Sets in Subquartic Planar Graphs;WALCOM: Algorithms and Computation;2016