Digraph decompositions and monotonicity in digraph searching (Q638540): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.tcs.2011.05.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2036443333 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4500916 / 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: DAG-Width and Parity Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic for Programming, Artificial Intelligence, and Reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotonicity in graph searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4699283 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3418339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fugitive-search games on graphs and related parameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / 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: On the monotonicity of games generated by symmetric submodular functions. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Digraph Width Measures in Parameterized Algorithmics / 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: Q4198056 / 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: Q3172533 / 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: On the Algorithmic Effectiveness of Digraph Decompositions and Complexity Measures / 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: An Algorithm for Finding a Minimum Equivalent Graph of a Digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: DAG-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2741376 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching for a Visible, Lazy Fugitive / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2005 / 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: Sweeping graphs with large clique number / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:22, 4 July 2024

scientific article
Language Label Description Also known as
English
Digraph decompositions and monotonicity in digraph searching
scientific article

    Statements

    Digraph decompositions and monotonicity in digraph searching (English)
    0 references
    0 references
    0 references
    12 September 2011
    0 references
    directed path-width
    0 references
    directed tree-width
    0 references
    DAG-width
    0 references
    Kelly-width
    0 references
    entanglement
    0 references
    graph searching
    0 references
    cops and robber games
    0 references
    monotonicity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers