On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width (Q972346): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4273870 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3812222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Relationship Between Clique-Width and Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Operations Characterizing Rank-Width and Balanced Graph Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph operations characterizing rank-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time solvable optimization problems on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds to the clique width of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4448752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of first-order and monadic second-order logic revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Polynomial Algorithms on Graphs of Bounded Rank-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for vertex-partitioning problems on graphs with fixed clique-width. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-width, parse trees, and monadic second-order logic for matroids. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Branch-Decompositions and Rank-Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge dominating set and colorings on graphs with fixed clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-width and vertex-minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating clique-width and branch-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: MSOL partitioning problems on graphs of bounded treewidth and clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. X: Obstructions to tree-decomposition / rank
 
Normal rank

Latest revision as of 21:17, 2 July 2024

scientific article
Language Label Description Also known as
English
On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
scientific article

    Statements

    On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width (English)
    0 references
    0 references
    0 references
    25 May 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    rank-width
    0 references
    parameterized algorithm
    0 references
    Myhill-Nerode theorem
    0 references
    graph colouring
    0 references
    0 references