Extended MSO model checking via small vertex integrity (Q6185940): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W4385667336 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy problems for tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3789603 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5874480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized (Approximate) Defective Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defensive alliances in graphs of bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgraph isomorphism on graph classes that exclude a substructure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithmic framework for locally constrained homomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3423990 / 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 III : tree-decompositions, minors and complexity issues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3077955 / 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: Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated Domination and Covering: A Parameterized Perspective / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of vertex integrity and component order connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: What Makes Equitable Connected Partition Easy / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of some colorful problems parameterized by treewidth / 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: A survey on alliances and related parameters in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of coloring problems: treewidth versus vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of simultaneous diophantine approximation in combinatorial optimization / 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: Q4470237 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Safe number and integrity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Safe set problem on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelizing MSO Properties of Trees of Fixed Height, and Some Consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics / rank
 
Normal rank
Property / cites work
 
Property / cites work: When Trees Grow Low: Shrubs and Fast MSO1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On structural parameterizations of the bounded-degree vertex deletion problem / 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: Exploring the gap between treedepth and vertex cover through vertex integrity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3118384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin packing with fixed number of bins revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minkowski's Convex Body Theorem and Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5092394 / 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: Q3172385 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4820818 / 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: Integer Programming with a Fixed Number of Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fair edge deletion problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of fair deletion problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3012402 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic second order logic on graphs with local cardinality constraints / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:48, 22 August 2024

scientific article; zbMATH DE number 7785278
Language Label Description Also known as
English
Extended MSO model checking via small vertex integrity
scientific article; zbMATH DE number 7785278

    Statements

    Extended MSO model checking via small vertex integrity (English)
    0 references
    0 references
    0 references
    0 references
    9 January 2024
    0 references
    vertex integrity
    0 references
    monadic second-order logic
    0 references
    cardinality constraint
    0 references
    fixed-parameter tractability
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers