Solving problems on graphs of high rank-width (Q1709595): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q93047965, #quickstatements; #temporary_batch_1707216511891
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-017-0290-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2258298398 / 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: Boundary classes of graphs for the dominating set problem / 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: Digraph Decompositions and Eulerian Systems / 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: On feedback vertex set: new measure and new structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chordal editing is fixed-parameter tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Time Split Decomposition Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complement reducible graphs / 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: Decomposition of Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Meta-kernelization using Well-structured Modulators / 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: Meta-kernelization with Structural Parameters / 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: Distance labeling scheme and split decomposition / 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: Q3353058 / 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
Property / cites work
 
Property / cites work: Algorithmic Aspects of Vertex Elimination on Graphs / rank
 
Normal rank

Latest revision as of 09:44, 15 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
    0 references
    6 April 2018
    0 references
    fixed-parameter algorithms
    0 references
    rank-width
    0 references
    monadic second-order logic
    0 references
    parameterized complexity
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references