On the Monotonicity of Games Generated by Symmetric Submodular Functions

Authors:
Fedor V. Fomin;Dimitrios M. Thilikos
Affiliations:
-;-
Venue:
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Year:
2001

Citing 17
Cited 1

Searching and pebbling

Theoretical Computer Science
The complexity of searching a graph

Journal of the ACM (JACM)
On minimizing width in linear layouts

Discrete Applied Mathematics
Monotonicity in graph searching

Journal of Algorithms
Graph minors: X. obstructions to tree-decomposition

Journal of Combinatorial Theory Series B
Quickly excluding a forest

Journal of Combinatorial Theory Series B
The vertex separation number of a graph equals its path-width

Information Processing Letters
Recontamination does not help to search a graph

Journal of the ACM (JACM)
Graph searching and a min-max theorem for tree-width

Journal of Combinatorial Theory Series B
The vertex separation and search number of a graph

Information and Computation
Mixed searching and proper-path-width

Theoretical Computer Science
The Linkage of a Graph

SIAM Journal on Computing
A Sufficient Condition for Backtrack-Free Search

Journal of the ACM (JACM)
The congestion of n-cube layout on a rectangular grid

Discrete Mathematics - Special issue on Selected Topics in Discrete Mathematics conferences
Algorithms and obstructions for linear-width and related search parameters

Discrete Applied Mathematics
Graph Searching and Interval Completion

SIAM Journal on Discrete Mathematics
Extremal Graph Theory

Extremal Graph Theory

Digraph Decompositions and Monotonicity in Digraph Searching

Graph-Theoretic Concepts in Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.