On the monotonicity of process number
From MaRDI portal
Publication:299059
DOI10.1016/j.dam.2015.01.038zbMath1339.05257OpenAlexW2037115087MaRDI QIDQ299059
Nicolas Nisse, Ronan Pardo Soares
Publication date: 22 June 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2015.01.038
Games involving graphs (91A43) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (1)
Cites Work
- The dag-width of directed graphs
- Tradeoffs in process strategy games with application in the WDM reconfiguration problem
- Monotonicity of non-deterministic graph searching
- Digraph measures: Kelly decompositions, games, and orderings
- An annotated bibliography on guaranteed graph searching
- Monotony properties of connected visible graph searching
- Sweeping graphs with large clique number
- The vertex separation number of a graph equals its path-width
- Graph searching and a min-max theorem for tree-width
- Searching and pebbling
- Directed tree-width
- Characterization of graphs and digraphs with small process numbers
- A distributed algorithm for computing the node search number in trees
- Directed path-width and monotonicity in digraph searching
- Directed tree-width examples
- Are There Any Good Digraph Width Measures?
- On the Monotonicity of Weak Searching
- Monotonicity in graph searching
- Recontamination does not help to search a graph
- Digraph Decompositions and Monotonicity in Digraph Searching
- Digraph Strong Searching: Monotonicity and Complexity
This page was built for publication: On the monotonicity of process number
