Solving Problems on Graphs of High Rank-Width (Q3449829): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1507.05463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithm for finding the largest independent sets in graphs without forks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernel bounds for path and cycle problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on \(\alpha\)-redundant vertices in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of vertex colouring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of regular MSC languages / 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: Decomposition of Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4507228 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization Using Structural Parameters on Sparse Graph Classes / 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: Backdoors into heterogeneous classes of SAT and CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust algorithms for the stable set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Distance Hereditary Graphs Using Split Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical and efficient split decomposition via graph-labelled trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closing complexity gaps for coloring problems on \(H\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Branch-Decompositions and Rank-Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 3-Colorability Problem on Graphs with Maximum Degree Four / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elements of finite model theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent Set in <i>P</i><sub>5</sub>-Free Graphs in Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating clique-width and branch-width / rank
 
Normal rank

Latest revision as of 00:25, 11 July 2024

scientific article
Language Label Description Also known as
English
Solving Problems on Graphs of High Rank-Width
scientific article

    Statements

    Solving Problems on Graphs of High Rank-Width (English)
    0 references
    0 references
    0 references
    0 references
    30 October 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references