Pages that link to "Item:Q2641288"
From MaRDI portal
The following pages link to The monadic second-order logic of graphs. I: Recognizable sets of finite graphs (Q2641288):
Displayed 39 items.
- A comparison of compatible, finite, and inductive graph properties (Q1812942) (← links)
- The monadic second-order logic of graphs. VIII: Orientations (Q1842126) (← links)
- Uniform and nonuniform recognizability. (Q1853746) (← links)
- Counting modulo quantifiers on finite structures (Q1854352) (← links)
- Reduction algorithms for graphs of small treewidth (Q1854433) (← links)
- Node replacements in embedding normal form. (Q1872709) (← links)
- The monadic second-order logic of graphs. XIV: Uniformly sparse graphs and edge set quantifica\-tions. (Q1874383) (← links)
- Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs (Q1899445) (← links)
- Arity and alternation in second-order logic (Q1919768) (← links)
- The monadic second-order logic of graphs. XI: Hierarchical decompositions of connected graphs (Q1960417) (← links)
- Upper bounds to the clique width of graphs (Q1975365) (← links)
- Handle-rewriting hypergraph grammars (Q2366278) (← links)
- Tree-edges deletion problems with bounded diameter obstruction sets (Q2370427) (← links)
- The \(d\)-precoloring problem for \(k\)-degenerate graphs (Q2370443) (← links)
- Grad and classes with bounded expansion. I: Decompositions (Q2426456) (← links)
- Grad and classes with bounded expansion. II: Algorithmic aspects (Q2426457) (← links)
- On the complexity of dominating set problems related to the minimum all-ones problem (Q2456358) (← links)
- Algorithms for finding distance-edge-colorings of graphs (Q2457301) (← links)
- Tree decomposition and discrete optimization problems: a survey (Q2480502) (← links)
- The computational complexity of the parallel knock-out problem (Q2481963) (← links)
- Algebraic recognizability of regular tree languages (Q2484441) (← links)
- Branch-width, parse trees, and monadic second-order logic for matroids. (Q2490835) (← links)
- Recognizability of graph and pattern languages (Q2491214) (← links)
- Message-passing automata are expressively equivalent to EMSO logic (Q2503037) (← links)
- The recognizability of sets of graphs is a robust property (Q2566292) (← links)
- A geometrical view of the determinization and minimization of finite-state automata (Q3210193) (← links)
- Graph decompositions for cartesian products (Q3439368) (← links)
- The monadic second-order logic of graphs, II: Infinite graphs of bounded width (Q3470112) (← links)
- Distance Constrained Labelings of Trees (Q3502639) (← links)
- Towards a characterization of order-invariant queries over tame graphs (Q3616348) (← links)
- The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues (Q4012672) (← links)
- Graph decompositions and tree automata in reasoning with uncertainty (Q4286533) (← links)
- (Q4852905) (← links)
- Equivalent definitions of recognizability for sets of graphs of bounded tree-width (Q4882496) (← links)
- On spectra of sentences of monadic second order logic with counting (Q5311744) (← links)
- Optimization and Recognition for K 5-minor Free Graphs in Linear Time (Q5458529) (← links)
- Grid structures and undecidable constraint theories (Q5941204) (← links)
- The edge-disjoint paths problem is NP-complete for series-parallel graphs (Q5954246) (← links)
- Computing LOGCFL certificates (Q5958329) (← links)