Entanglement and the complexity of directed graphs (Q1929212): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4039803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undirected Graphs of Entanglement 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: DAG-Width and Parity Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dag-width of directed graphs / 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: Q4411834 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The variable hierarchy of the \(\mu\)-calculus is strict / 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: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Descriptive Complexity of Parity Games / 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: Directed Graphs of Entanglement Two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934648 / 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: Space-bounded reducibility among combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Results on the propositional \(\mu\)-calculus / 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: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: DAG-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. I. Excluding a forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. III. Planar tree-width / 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: Bisimulation, modal logic and model checking games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite games on finitely coloured graphs with applications to automata on infinite trees / rank
 
Normal rank

Latest revision as of 02:20, 6 July 2024

scientific article
Language Label Description Also known as
English
Entanglement and the complexity of directed graphs
scientific article

    Statements

    Entanglement and the complexity of directed graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 January 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    structural graph theory
    0 references
    graph searching games
    0 references
    parity games
    0 references
    digraph algorithms
    0 references
    treewidth
    0 references
    DAG-width
    0 references
    Kelly-width
    0 references
    0 references