On the monotonicity of process number (Q299059): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2015.01.038 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2015.01.038 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2037115087 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed tree-width examples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed path-width and monotonicity in digraph searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dag-width of directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotonicity in graph searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tradeoffs in process strategy games with application in the WDM reconfiguration problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A distributed algorithm for computing the node search number in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of graphs and digraphs with small process numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: An annotated bibliography on guaranteed graph searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotony properties of connected visible graph searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Are There Any Good Digraph Width Measures? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digraph measures: Kelly decompositions, games, and orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vertex separation number of a graph equals its path-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching and pebbling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digraph Decompositions and Monotonicity in Digraph Searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recontamination does not help to search a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotonicity of non-deterministic graph searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph searching and a min-max theorem for tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digraph Strong Searching: Monotonicity and Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Monotonicity of Weak Searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sweeping graphs with large clique number / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2015.01.038 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:45, 9 December 2024

scientific article
Language Label Description Also known as
English
On the monotonicity of process number
scientific article

    Statements

    On the monotonicity of process number (English)
    0 references
    0 references
    0 references
    22 June 2016
    0 references
    graph searching
    0 references
    process number
    0 references
    monotonicity
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references