, Volume 71, Issue 3, pp 566–580 | Cite as

Multi-parameter Analysis for Local Graph Partitioning Problems: Using Greediness for Parameterization

  • Édouard BonnetEmail author
  • Bruno Escoffier
  • Vangelis Th. Paschos
  • Émeric Tourniaire


We study the parameterized complexity of a broad class of problems called “local graph partitioning problems” that includes the classical fixed cardinality problems as max \(k\)-vertex cover, \(k\)-densest subgraph, etc. By developing a technique that we call “greediness-for-parameterization”, we obtain fixed parameter algorithms with respect to a pair of parameters \(k\), the size of the solution (but not its value) and \(\varDelta \), the maximum degree of the input graph. In particular, greediness-for-parameterization improves asymptotic running times for these problems upon random separation (that is a special case of color coding) and is more intuitive and simple. Then, we show how these results can be easily extended for getting standard-parameterization results (i.e., with parameter the value of the optimal solution) for a well known local graph partitioning problem.


Parameterized complexity FPT Greedy Branching  Local partitioning problems 


  1. 1.
    Ageev, A.A., Sviridenko, M.: Approximation algorithms for maximum coverage and max cut with given sizes of parts. In: Cornuéjols, G., Burkard, R.E., Woeginger, G.J. (eds.) Proceedings of Conference on Integer Programming and Combinatorial Optimization, IPCO’99, volume 1610 of Lecture Notes in Computer Science, pp. 17–30. Springer, Berlin (1999)Google Scholar
  2. 2.
    Alon, N., Yuster, R., Zwick, U.: Color-coding. J. Assoc. Comput. Mach. 42(4), 844–856 (1995)CrossRefzbMATHMathSciNetGoogle Scholar
  3. 3.
    Cai, L.: Parameter complexity of cardinality constrained optimization problems. Comput. J. 51, 102–121 (2008)CrossRefGoogle Scholar
  4. 4.
    Cai, L., Chan, S.M., Chan, S.O.: Random separation: a new method for solving fixed-cardinality optimization problems. In: Bodlaender, H.L., Langston, M.A. (eds.) Proceedings of International Workshop on Parameterized and Exact Computation, IWPEC’06, volume 4169 of Lecture Notes in Computer Science, pp. 239–250. Springer, Berlin (2006)Google Scholar
  5. 5.
    Chen, J., Kanj, I.A., Xia, G.: Improved upper bounds for vertex cover. Theor. Comput. Sci. 411(40–42), 3736–3756 (2010)CrossRefzbMATHMathSciNetGoogle Scholar
  6. 6.
    Courcelle, B.: The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Inf. Comput. 85, 12–75 (1990)CrossRefzbMATHMathSciNetGoogle Scholar
  7. 7.
    Cygan, M., Lokshtanov, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Minimum bisection is fixed parameter tractable. In: Proceedings of ACM Symposium on Theory of Computing, STOC’14, pp. 323–332. ACM, New York (2014)Google Scholar
  8. 8.
    Downey, R.G., Estivill-Castro, V., Fellows, M.R., Prieto, E., Rosamond, F.A.: Cutting up is hard to do: the parameterized complexity of \(k\)-cut and related problems. In: Electronic Notes in Theoretical Computer Science, vol. 78, pp. 205–218. Elsevier, Amsterdam (2003)Google Scholar
  9. 9.
    Feige, U., Krauthgamer, R., Nissim, K.: On cutting a few vertices from a graph. Discrete Appl. Math. 127(3), 643–649 (2003)CrossRefzbMATHMathSciNetGoogle Scholar
  10. 10.
    Feige, U., Langberg, M.: Approximation algorithms for maximization problems arising in graph partitioning. J. Algorithms 41(2), 174–211 (2001)CrossRefzbMATHMathSciNetGoogle Scholar
  11. 11.
    Fomin, F.V., Golovach, P.A., Korhonen, J.H.: On the parameterized complexity of cutting a few vertices from a graph. CORR, abs/1304.6189 (2013)Google Scholar
  12. 12.
    Kloks, T.: Treewidth, Computations and Approximations, volume 842 of Lecture Notes in Computer Science. Springer, Berlin (1994)Google Scholar
  13. 13.
    Komusiewicz, C., Sorge, M.: Finding dense subgraphs of sparse graphs. In: Thilikos, D.M., Woeginger, G.J. (eds.) Proceedings of International Symposium on Parameterized and Exact Computation, IPEC’12, volume 7535 of Lecture Notes in Computer Science, pp. 242–251. Springer, Berlin (2012)Google Scholar
  14. 14.
    Lewis, H.R., Papadimitriou, C.H.: Elements of the Theory of Computation. Prentice-Hall, Prentice (1981)zbMATHGoogle Scholar
  15. 15.
    Maneth, S.: Logic and Automata. Lecture 3: Expressiveness of MSO Graph Properties. Logic Summer School (2006)Google Scholar
  16. 16.
    Marx, D.: Parameterized complexity and approximation algorithms. Comput. J. 51(1), 60–78 (2008)CrossRefGoogle Scholar
  17. 17.
    Shachnai, H., Zehavi, M.: Parameterized algorithms for graph partitioning problems. CoRR, abs/1403.0099 (2014)Google Scholar
  18. 18.
    Szeider, S.: Monadic second order logic on graphs with local cardinality constraints. ACM Trans. Comput. Log. 12(2) (2011). doi: 10.1145/1877714.1877718

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  • Édouard Bonnet
    • 1
    Email author
  • Bruno Escoffier
    • 2
    • 3
  • Vangelis Th. Paschos
    • 1
    • 4
  • Émeric Tourniaire
    • 1
  1. 1.LAMSADE, CNRS UMR 7243PSL Research University, Université Paris-DauphineParisFrance
  2. 2.UMR 7606, LIP6Sorbonne Universités, UPMC Université Paris 06ParisFrance
  3. 3.UMR 7606, LIP6CNRSParisFrance
  4. 4.Institut Universitaire de FranceParisFrance

Personalised recommendations