On the monotonicity of process number

DOI10.1016/J.DAM.2015.01.038MaRDI QIDQ299059zbMATHOpenAlexFDO

Authors 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

zbMATH Keywords

monotonicitygraph searchingprocess number

Mathematics Subject Classification ID

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)

Recommendations

• Digraph Decompositions and Monotonicity in Digraph Searching
• Digraph decompositions and monotonicity in digraph searching
• Monotonicity in digraph search problems
• Monotonicity of strong searching on digraphs
• Directed path-width and monotonicity in digraph searching

Cites work

• A distributed algorithm for computing the node search number in trees
• An annotated bibliography on guaranteed graph searching
• Are there any good digraph width measures?
• Characterization of graphs and digraphs with small process numbers
• Digraph Decompositions and Monotonicity in Digraph Searching
• Digraph Strong Searching: Monotonicity and Complexity
• Digraph measures: Kelly decompositions, games, and orderings
• Directed path-width and monotonicity in digraph searching
• Directed tree-width
• Directed tree-width examples
• Graph searching and a min-max theorem for tree-width
• Monotonicity in graph searching
• Monotonicity of non-deterministic graph searching
• Monotony properties of connected visible graph searching
• On the Monotonicity of Weak Searching
• Recontamination does not help to search a graph
• Searching and pebbling
• Sweeping graphs with large clique number
• The dag-width of directed graphs
• The vertex separation number of a graph equals its path-width
• Tradeoffs in process strategy games with application in the WDM reconfiguration problem

Cited in

(7)

• The connected graphs obtained from finite projective planes
• Digraph Decompositions and Monotonicity in Digraph Searching
• Tradeoffs in process strategy games with application in the WDM reconfiguration problem
• Monitoring \(k\)th order runs in binary processes
• Characterization of graphs and digraphs with small process numbers
• Digraph decompositions and monotonicity in digraph searching
• Monotone Case for an Extended Process

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)