LIFO-search: a min-max theorem and a searching game for cycle-rank and tree-depth (Q713301): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2012.03.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2067942639 / 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: DAG-Width and Parity Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotonicity in graph searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rankings of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal edge ranking of trees in polynomial time / 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: Q4942652 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transition graphs and the star-height of regular events / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Theory of Elimination Trees for Sparse Unsymmetric Matrices / 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: Q2857377 / rank
 
Normal rank
Property / cites work
 
Property / cites work: LIFO-Search on Digraphs: A Searching Game for Cycle-Rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordered colourings / 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: Grad and classes with bounded expansion. II: Algorithmic aspects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time low tree-width partitions and algorithmic consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-depth, subgraph coloring and homomorphism bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grad and classes with bounded expansion. I: Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: DAG-width / 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

Latest revision as of 19:09, 5 July 2024

scientific article
Language Label Description Also known as
English
LIFO-search: a min-max theorem and a searching game for cycle-rank and tree-depth
scientific article

    Statements

    LIFO-search: a min-max theorem and a searching game for cycle-rank and tree-depth (English)
    0 references
    0 references
    0 references
    26 October 2012
    0 references
    graph parameters
    0 references
    graph searching
    0 references
    pursuit-evasion games
    0 references
    cycle-rank
    0 references
    tree-depth
    0 references
    obstructions
    0 references
    min-max theorem
    0 references

    Identifiers