On the model-checking of monadic second-order formulas with edge set quantifications (Q415286): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an 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.1016/j.dam.2010.12.017 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2088523331 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domino Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asteroids in rooted and directed path graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Relationship Between Clique-Width and Treewidth / 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: Automata for the verification of monadic second-order graph properties / 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: Upper bounds to the clique width of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-Width is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / 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: A recognition algorithm for the intersection graphs of directed paths in directed trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Branch-Decompositions and Rank-Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elements of finite model theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating clique-width and branch-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3692864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cosmological lower bound on the circuit complexity of a small problem in logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of S1S and S2S / rank
 
Normal rank
Property / cites work
 
Property / cites work: On tree-partition-width / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:22, 5 July 2024

scientific article
Language Label Description Also known as
English
On the model-checking of monadic second-order formulas with edge set quantifications
scientific article

    Statements

    On the model-checking of monadic second-order formulas with edge set quantifications (English)
    0 references
    0 references
    11 May 2012
    0 references
    tree-width
    0 references
    clique-width
    0 references
    monadic second-order logic
    0 references
    graph decomposition
    0 references
    model-checking
    0 references

    Identifiers

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