On the monotonicity of games generated by symmetric submodular functions

21Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

Fomin, F. V., & Thilikos, D. M. (2003). On the monotonicity of games generated by symmetric submodular functions. In Discrete Applied Mathematics (Vol. 131, pp. 323–335). https://doi.org/10.1016/S0166-218X(02)00459-6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free