Handle-rewriting hypergraph grammars
From MaRDI portal
Publication:2366278
Recommendations
Cites work
- scientific article; zbMATH DE number 3846895 (Why is no real title available?)
- scientific article; zbMATH DE number 3856429 (Why is no real title available?)
- scientific article; zbMATH DE number 3819112 (Why is no real title available?)
- scientific article; zbMATH DE number 3943061 (Why is no real title available?)
- scientific article; zbMATH DE number 4035178 (Why is no real title available?)
- scientific article; zbMATH DE number 4049099 (Why is no real title available?)
- scientific article; zbMATH DE number 4049100 (Why is no real title available?)
- scientific article; zbMATH DE number 4049105 (Why is no real title available?)
- scientific article; zbMATH DE number 4051027 (Why is no real title available?)
- scientific article; zbMATH DE number 4060748 (Why is no real title available?)
- scientific article; zbMATH DE number 17539 (Why is no real title available?)
- scientific article; zbMATH DE number 177437 (Why is no real title available?)
- scientific article; zbMATH DE number 177438 (Why is no real title available?)
- scientific article; zbMATH DE number 177441 (Why is no real title available?)
- scientific article; zbMATH DE number 1142315 (Why is no real title available?)
- A comparison of boundary graph grammars and context-free hypergraph grammars
- Algebraic automata and context-free sets
- An axiomatic definition of context-free rewriting and its application to NLC graph grammars
- Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
- Boundary graph grammars with dynamic edge relabeling
- Complement reducible graphs
- Context-free hypergraph grammars have the same term-generating power as attribute grammars
- Edge-label controlled graph grammars
- Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
- Graph expressions and graph rewritings
- Graph grammars and their application to computer science. 4th international workshop, Bremen, Germany, March 5-9, 1990. Proceedings
- Graph-grammars and their application to computer science. 3rd International Workshop, Warrenton, Virginia, USA, December 2-6, 1986
- Handle NLC grammars and r. e. languages
- Hyperedge replacement: grammars and languages
- Hypergraph languages of bounded degree
- Linear graph grammars: Power and complexity
- Nonterminal separation in graph grammars
- On the structure of node-label-controlled graph languages
- The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- The string generating power of context-free hypergraph grammars
Cited in
(only showing first 100 items - show all)- Double Greibach operator grammars
- Trees, grids, and MSO decidability: from graphs to matroids
- Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
- The complexity of the \(K_{n,n}\)-problem for node replacement graph languages
- Practical algorithms for MSO model-checking on tree-decomposable graphs
- The parametrized complexity of knot polynomials
- Node replacement in hypergraphs: simulation of hyperedge replacement, and decidability of confluence
- Clique-width of path powers
- Towards fixed-parameter tractable algorithms for abstract argumentation
- Recognizability, hypergraph operations, and logical types
- HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting
- Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs
- GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH
- On low rank-width colorings
- The evaluation of first-order substitution is monadic second-order compatible
- Infinitely many minimal classes of graphs of unbounded clique-width
- Computing densest \(k\)-subgraph with structural parameters
- Node replacements in embedding normal form.
- Algorithmic uses of the Feferman-Vaught theorem
- A new representation of proper interval graphs with an application to clique-width
- Automatic graphs and D0L-sequences of finite graphs
- On the computational difficulty of the terminal connection problem
- Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs
- Graphs of separability at most 2
- Polynomial-time recognition of clique-width 3 graphs
- Graphs of linear clique-width at most 3
- On variations of \(P_{4}\)-sparse graphs
- Mike Fellows: Weaving the Web of Mathematics and Adventure
- The maximum weight stable set problem in (\(P_6\), bull)-free graphs
- Node replacement graph grammars with dynamic node relabeling
- Tree-depth and vertex-minors
- scientific article; zbMATH DE number 177438 (Why is no real title available?)
- Basic notions of universal algebra for language theory and graph grammars
- Computing the clique-width of cactus graphs
- Well-quasi-ordering versus clique-width
- On a disparity between relative cliquewidth and relative NLC-width
- Recent developments on graphs of bounded clique-width
- Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width.
- Tree-width and the monadic quantifier hierarchy.
- Uncountably many minimal hereditary classes of graphs of unbounded clique-width
- On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems
- Nondeterministic operations on finite relational structures
- Fast FPT-approximation of branchwidth
- Eigenvalue location in graphs of small clique-width
- New Plain-Exponential Time Classes for Graph Homomorphism
- 4-coloring \((P_6, \text{bull})\)-free graphs
- Graph grammars according to the type of input and manipulated data: a survey
- Structure and stability number of chair-, co-P- and gem-free graphs revisited
- On the structure of (\(P_{5}\),\,gem)-free graphs
- Algorithms for some graph theoretical optimization problems (abstract of thesis)
- Concatenation of graphs
- HRNCE grammars — A hypergraph generating system with an eNCE way of rewriting
- Homogeneous sets and domination: A linear time algorithm for distance-hereditary graphs
- scientific article; zbMATH DE number 809155 (Why is no real title available?)
- Fifty years of the spectrum problem: survey and new results
- A coloring algorithm for \(4 K_1\)-free line graphs
- Edge dominating set and colorings on graphs with fixed clique-width
- Algorithms for vertex-partitioning problems on graphs with fixed clique-width.
- Graph functionality
- Vertex-minors, monadic second-order logic, and a conjecture by Seese
- Hypergraphs with polynomial representation: introducing \(r\)-splits
- On coloring a class of claw-free graphs.
- Monadic second-order definable graph transductions: a survey
- A comparison of tree transductions defined by monadic second order logic and by attribute grammars
- Distance labeling scheme and split decomposition
- LINEAR TIME RECOGNITION AND OPTIMIZATIONS FOR WEAK-BISPLIT GRAPHS, BI-COGRAPHS AND BIPARTITE P6-FREE GRAPHS
- Computing the clique-width of large path powers in linear time via a new characterisation of clique-width
- Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width
- Tractability, hardness, and kernelization lower bound for and/or graph solution
- Well-quasi-ordering of matrices under Schur complement and applications to directed graphs
- Boolean-width of graphs
- scientific article; zbMATH DE number 4041304 (Why is no real title available?)
- On the clique-width of some perfect graph classes
- Well-quasi-order of relabel functions
- Spined categories: generalizing tree-width beyond graphs
- Upper bounds to the clique width of graphs
- A Framework for Minimal Hereditary Classes of Graphs of Unbounded Clique-Width
- Boundary classes for graph problems involving non-local properties
- On the thinness and proper thinness of a graph
- Fast exact algorithms for some connectivity problems parameterized by clique-width
- MSOL partitioning problems on graphs of bounded treewidth and clique-width
- \(t\)-sails and sparse hereditary classes of unbounded tree-width
- Clique-width of partner-limited graphs
- Solving some NP-complete problems using split decomposition
- Separation results for separated apex NLC and NCE graph languages
- Clique-width with an inactive label
- Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time.
- Practical and efficient split decomposition via graph-labelled trees
- Recognizing map graphs of bounded treewidth
- Exponential time analysis of confluent and boundary eNCE graph languages
- MSO undecidability for hereditary classes of unbounded clique-width
- \(b\)-coloring parameterized by clique-width
- On prime inductive classes of graphs
- Independent domination in finitely defined classes of graphs
- The equivalence of boundary and confluent graph grammars on graph languages of bounded degree
- C-planarity testing of embedded clustered graphs with bounded dual carving-width
- Hypergraph languages of bounded degree
- A survey of the algorithmic aspects of modular decomposition
- A characterisation of clique-width through nested partitions
- Deciding atomicity of subword-closed languages
This page was built for publication: Handle-rewriting hypergraph grammars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2366278)
