Pages that link to "Item:Q2366278"
From MaRDI portal
The following pages link to Handle-rewriting hypergraph grammars (Q2366278):
Displayed 50 items.
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- Basic notions of universal algebra for language theory and graph grammars (Q671349) (← links)
- Trees, grids, and MSO decidability: from graphs to matroids (Q820150) (← links)
- Vertex-minors, monadic second-order logic, and a conjecture by Seese (Q858683) (← links)
- Algorithms for some graph theoretical optimization problems (abstract of thesis) (Q862821) (← links)
- MSOL partitioning problems on graphs of bounded treewidth and clique-width (Q884481) (← links)
- Solving some NP-complete problems using split decomposition (Q948695) (← links)
- Clique-width of graphs defined by one-vertex extensions (Q998353) (← links)
- Structure and stability number of chair-, co-P- and gem-free graphs revisited (Q1007592) (← links)
- Order independent NCE grammars recognized in polynomial time (Q1182091) (← links)
- Nondeterministic operations on finite relational structures (Q1276248) (← links)
- Separating \(k\)-separated eNCE graph languages (Q1314371) (← links)
- Hypergraph languages of bounded degree (Q1318469) (← links)
- Monadic second-order definable graph transductions: a survey (Q1325847) (← links)
- The bounded degree problem for eNCE graph grammars (Q1363781) (← links)
- Logical description of context-free graph languages (Q1384534) (← links)
- Independent domination in finitely defined classes of graphs (Q1399990) (← links)
- Tree-width and the monadic quantifier hierarchy. (Q1401360) (← links)
- Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width. (Q1401972) (← links)
- On variations of \(P_{4}\)-sparse graphs (Q1406046) (← links)
- Stability number of bull- and chair-free graphs revisited (Q1408811) (← links)
- On the structure and stability number of \(P_{5}\)- and co-chair-free graphs (Q1414581) (← links)
- Distance labeling scheme and split decomposition (Q1417571) (← links)
- Clique-width of partner-limited graphs (Q1422439) (← links)
- (\(P_{5}\), diamond)-free graphs revisited: Structure and linear time optimization. (Q1428548) (← links)
- Generating irregular partitionable data structures (Q1575237) (← links)
- A comparison of tree transductions defined by monadic second order logic and by attribute grammars (Q1582010) (← links)
- Double Greibach operator grammars (Q1589438) (← links)
- The evaluation of first-order substitution is monadic second-order compatible (Q1603690) (← links)
- On the structure of (\(P_{5}\),\,gem)-free graphs (Q1764802) (← links)
- Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width (Q1764808) (← links)
- Finite graph automata for linear and boundary graph languages (Q1770387) (← links)
- Chordal bipartite graphs of bounded tree- and clique-width (Q1827785) (← links)
- The monadic second-order logic of graphs. VIII: Orientations (Q1842126) (← links)
- Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time. (Q1853148) (← links)
- The complexity of the \(K_{n,n}\)-problem for node replacement graph languages (Q1854438) (← links)
- Edge dominating set and colorings on graphs with fixed clique-width (Q1861574) (← links)
- Node replacements in embedding normal form. (Q1872709) (← links)
- Algorithms for vertex-partitioning problems on graphs with fixed clique-width. (Q1874418) (← links)
- Automatic graphs and D0L-sequences of finite graphs (Q1877692) (← links)
- The parametrized complexity of knot polynomials (Q1877705) (← links)
- HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting (Q1960412) (← links)
- Upper bounds to the clique width of graphs (Q1975365) (← links)
- Finding a minimum path cover of a distance-hereditary graph in polynomial time (Q2457005) (← links)
- Counting truth assignments of formulas of bounded tree-width or clique-width (Q2473047) (← links)
- Distance-hereditary graphs are clique-perfect (Q2489948) (← links)
- Recognizability, hypergraph operations, and logical types (Q2496296) (← links)
- Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs (Q2566023) (← links)
- The recognizability of sets of graphs is a robust property (Q2566292) (← links)
- Homogeneous sets and domination: A linear time algorithm for distance?hereditary graphs (Q2719843) (← links)