Algorithmic meta-theorems for restrictions of treewidth (Q1759681): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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-011-9554-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2142055019 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy problems for tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: (Meta) Kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Parameterized Upper Bounds for Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear FPT reductions and computational lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling Salesman Problem with Many Visits to Few Cities / 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: Linear time solvable optimization problems on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Layout Problems Parameterized by Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity ecology of parameters: An illustration using bounded max leaf number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intractability of Clique-Width Parameterizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding first-order properties of locally tree-decomposable structures / 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: The complexity of homomorphism and constraint satisfaction problems seen from the other side / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning Trees with Many Leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed Nowhere Dense Classes of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming with a Fixed Number of Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. I. Excluding a forest / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:33, 5 July 2024

scientific article
Language Label Description Also known as
English
Algorithmic meta-theorems for restrictions of treewidth
scientific article

    Statements

    Algorithmic meta-theorems for restrictions of treewidth (English)
    0 references
    0 references
    0 references
    21 November 2012
    0 references
    vertex cover
    0 references
    max-leaf number
    0 references
    MSO logic
    0 references
    Courcelle's theorem
    0 references

    Identifiers

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