On the monotonicity of games generated by symmetric submodular functions

  • Fomin F
  • Thilikos D
  • 4


    Mendeley users who have this article in their library.
  • 21


    Citations of this article.


Submodular functions have appeared to be a key tool for proving the monotonicity of several graph searching games. In this paper, we provide a general game theoretic framework able to unify old and new monotonicity results in a unique min-max theorem. Our theorem provides a game theoretic analogue to a wide number of graph theoretic parameters such as linear-width and cutwidth. © 2003 Elsevier B.V. All rights reserved.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Fedor V. Fomin

  • Dimitrios M. Thilikos

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free