Pages that link to "Item:Q4379556"
From MaRDI portal
The following pages link to Handbook of Graph Grammars and Computing by Graph Transformation (Q4379556):
Displaying 50 items.
- Tree-width and the monadic quantifier hierarchy. (Q1401360) (← links)
- Query efficient implementation of graphs of bounded clique-width (Q1408820) (← links)
- The monadic second-order logic of graphs. XIII: Graph drawings with edge crossings (Q1575704) (← links)
- A comparison of tree transductions defined by monadic second order logic and by attribute grammars (Q1582010) (← links)
- Hierarchical graph transformation (Q1608318) (← links)
- Recognizing optimal 1-planar graphs in linear time (Q1702117) (← links)
- Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs (Q1730221) (← links)
- The PBPO graph transformation approach (Q1734525) (← links)
- Reachability analysis of reversal-bounded automata on series-parallel graphs (Q1741900) (← links)
- Grammatical inference of directed acyclic graph languages with polynomial time complexity (Q1747486) (← links)
- Grammar-based model transformations: definition, execution, and quality properties (Q1749124) (← links)
- Multiple context-free tree grammars: lexicalization and characterization (Q1749480) (← links)
- Finite graph automata for linear and boundary graph languages (Q1770387) (← links)
- Macro tree transducers, attribute grammars, and MSO definable tree translations. (Q1854312) (← links)
- The complexity of the \(K_{n,n}\)-problem for node replacement graph languages (Q1854438) (← links)
- Reducibility between classes of port graph grammar. (Q1872703) (← links)
- Node replacements in embedding normal form. (Q1872709) (← links)
- Automatic graphs and D0L-sequences of finite graphs (Q1877692) (← links)
- Clustering for Petri nets (Q1884880) (← links)
- Graph traversal and graph transformation (Q1885899) (← 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)
- Verifying polymer reaction networks using bisimulation (Q2003997) (← links)
- Algebraic graph rewriting with controlled embedding (Q2007726) (← links)
- Graph transformation through graph surfing in reaction systems (Q2011207) (← links)
- On the essence and initiality of conflicts in \(\mathcal{M} \)-adhesive transformation systems (Q2011208) (← links)
- Formal specification and verification of dynamic parametrized architectures (Q2024379) (← links)
- A structural approach to graph transformation based on symmetric Petri nets (Q2035652) (← links)
- Single pushout rewriting in comprehensive systems of graph-like structures (Q2049985) (← links)
- Concurrent semantics for fusions: weak prime domains and connected event structures (Q2051794) (← links)
- Comprehensive systems: a formal foundation for multi-model consistency management (Q2065549) (← links)
- A tale of two graph models: a case study in wireless sensor networks (Q2065559) (← links)
- Two-dimensional models (Q2074211) (← links)
- Hypergraph Lambek grammars (Q2079680) (← links)
- Context-sensitive fusion grammars and fusion grammars with forbidden context are universal (Q2084774) (← links)
- Rule-based top-down parsing for acyclic contextual hyperedge replacement grammars (Q2117263) (← links)
- Ranking of network elements based on functional substructures (Q2211624) (← links)
- Parallel rewriting of attributed graphs (Q2215963) (← links)
- Solutions for subset sum problems with special digraph constraints (Q2216192) (← links)
- Parallel coherent graph transformations (Q2237338) (← links)
- Language theoretic properties of regular DAG languages (Q2272978) (← links)
- A calculus of concurrent graph-rewriting processes (Q2291821) (← links)
- Labelled port graph -- a formal structure for models and computations (Q2333309) (← links)
- Node replacement graph grammars with dynamic node relabeling (Q2342679) (← links)
- Rule-based transformation of graph rewriting rules: towards higher-order graph grammars (Q2355681) (← links)
- Theorem proving graph grammars with attributes and negative application conditions (Q2358623) (← links)
- Incremental construction of coverability graphs (Q2379973) (← links)
- Labelled graph strategic rewriting for social networks (Q2413024) (← links)
- Drags: a compositional algebraic framework for graph rewriting (Q2422028) (← links)
- Specifying graph languages with type graphs (Q2423749) (← links)
