On the monotonicity of process number
DOI10.1016/J.DAM.2015.01.038zbMATH Open1339.05257OpenAlexW2037115087MaRDI QIDQ299059FDOQ299059
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
Recommendations
Directed graphs (digraphs), tournaments (05C20) Games on graphs (graph-theoretic aspects) (05C57) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24)
Cites Work
- Graph searching and a min-max theorem for tree-width
- Searching and pebbling
- Directed tree-width
- Directed path-width and monotonicity in digraph searching
- Are There Any Good Digraph Width Measures?
- The dag-width of directed graphs
- Digraph measures: Kelly decompositions, games, and orderings
- An annotated bibliography on guaranteed graph searching
- Recontamination does not help to search a graph
- Sweeping graphs with large clique number
- The vertex separation number of a graph equals its path-width
- Characterization of graphs and digraphs with small process numbers
- A distributed algorithm for computing the node search number in trees
- Directed tree-width examples
- On the Monotonicity of Weak Searching
- Monotonicity in graph searching
- Digraph Decompositions and Monotonicity in Digraph Searching
- Digraph Strong Searching: Monotonicity and Complexity
- Tradeoffs in process strategy games with application in the WDM reconfiguration problem
- Monotonicity of non-deterministic graph searching
- Monotony properties of connected visible graph searching
Cited In (3)
This page was built for publication: On the monotonicity of process number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q299059)
