Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity (Q1687933): Difference between revisions

From MaRDI portal
Merged Item from Q5207049
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On the (Parameterized) Complexity of Recognizing Well-Covered $$(r,\ell )$$ -graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Time Algorithms for Happy Vertex Coloring Problems for Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of computing balanced partitions in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time algorithm for finding tree-decompositions of small treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth: Characterizations, Applications, and Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The graph motif problem parameterized by the structure of the input graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elections with Few Candidates: Prices, Weights, and Covering Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended formulations in combinatorial optimization / 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: The monadic second order logic of graphs. VI: On several representations of graphs by relational structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. XIV: Uniformly sparse graphs and edge set quantifica\-tions. / 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: Monadic second-order evaluations on tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5091008 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper and lower bounds for finding connected motifs in vertex-colored graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of distance labeling and uniform channel assignment problems / 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: Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of conflict-free colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic datalog over finite structures of bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3118384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth. Computations and approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Courcelle's theorem -- a game-theoretic approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5092394 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjunctive-query containment and constraint satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extension Complexity, MSO Logic, and Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic meta-theorems for restrictions of treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model Checking Lower Bounds for Simple 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: Elements of finite model theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of fair deletion problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3539854 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problems Parameterized by Treewidth Tractable in Single Exponential Time: A Logical Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic Second Order Logic on Graphs with Local Cardinality Constraints / rank
 
Normal rank

Revision as of 08:29, 21 July 2024

scientific article; zbMATH DE number 7147441
Language Label Description Also known as
English
Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity
scientific article; zbMATH DE number 7147441

    Statements

    Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 January 2018
    0 references
    3 January 2020
    0 references
    MSO extensions
    0 references
    metatheorem
    0 references
    parameterized complexity
    0 references
    neighborhood diversity
    0 references
    treewidth
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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