\(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth (Q972341): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q2784326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / 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: Compositions for perfect graphs / 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: Vertex-minors, monadic second-order logic, and a conjecture by Seese / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Decomposition Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4448752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633895 / 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: Transitiv orientierbare Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: On parse trees and Myhill-Nerode-type tools for handling 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: PARTITION REFINEMENT TECHNIQUES: AN INTERESTING ALGORITHMIC TOOL KIT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Branch-Decompositions and Rank-Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of perfect graphs / 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: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank‐width is less than or equal to branch‐width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating clique-width and branch-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three Partition Refinement Algorithms / 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
Property / cites work
 
Property / cites work: Algorithms for Vertex Partitioning Problems on Partial k-Trees / rank
 
Normal rank

Latest revision as of 21:16, 2 July 2024

scientific article
Language Label Description Also known as
English
\(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth
scientific article

    Statements

    \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth (English)
    0 references
    0 references
    0 references
    0 references
    25 May 2010
    0 references
    0 references
    algorithms
    0 references
    graphs
    0 references
    parameterized
    0 references
    independent set
    0 references
    rank-width
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references