AbstractTwo basic techniques are presented to show the decidability status of a number of problems concerning node label controlled graph grammars. Most of the problems are of graph-theoretic nature and concern topics like planarity, connectedness and bounded degreeness of graph languages
Within the data mining community, there has been a lot of interest the last few years in mining and ...
AbstractThe degree of a graph H is the maximum among the degrees of its nodes. A set of graphs L is ...
Abstract: We investigate sequential derivation languages associated with graph grammars, as a loose ...
AbstractWe present algorithms for analyzing single graphs and sets of graphs generated by boundary n...
AbstractThe degree of a graph H is the maximum among the degrees of its nodes. A set of graphs L is ...
AbstractThe complexity of the bounded degree problem is analyzed for graph languages generated by eN...
AbstractNode label controlled (NLC) grammars are graph grammars (operating on node labeled undirecte...
AbstractRegular directed node-label controlled graph grammars (RDNLC grammars for short) originated ...
Node label controlled (NLC) grammars are graph grammars (operating on node labeled undirected graphs...
AbstractA research into syntax analysis of node label controlled (NLC) graph grammars (introduced an...
Graph grammars can be regarded as a generalization of context-free grammars from strings to graphs. ...
AbstractWe present algorithms for analyzing single graphs and sets of graphs generated by boundary n...
AbstractNode-label controlled graph grammars (NLC grammars) are a mechanism to generate sets of grap...
AbstractGraph Grammar (GG) is an appropriate formal language for specifying complex systems. In a GG...
AbstractA graph grammar is linear if it generates graphs with at most one nonterminal node. Linear g...
Within the data mining community, there has been a lot of interest the last few years in mining and ...
AbstractThe degree of a graph H is the maximum among the degrees of its nodes. A set of graphs L is ...
Abstract: We investigate sequential derivation languages associated with graph grammars, as a loose ...
AbstractWe present algorithms for analyzing single graphs and sets of graphs generated by boundary n...
AbstractThe degree of a graph H is the maximum among the degrees of its nodes. A set of graphs L is ...
AbstractThe complexity of the bounded degree problem is analyzed for graph languages generated by eN...
AbstractNode label controlled (NLC) grammars are graph grammars (operating on node labeled undirecte...
AbstractRegular directed node-label controlled graph grammars (RDNLC grammars for short) originated ...
Node label controlled (NLC) grammars are graph grammars (operating on node labeled undirected graphs...
AbstractA research into syntax analysis of node label controlled (NLC) graph grammars (introduced an...
Graph grammars can be regarded as a generalization of context-free grammars from strings to graphs. ...
AbstractWe present algorithms for analyzing single graphs and sets of graphs generated by boundary n...
AbstractNode-label controlled graph grammars (NLC grammars) are a mechanism to generate sets of grap...
AbstractGraph Grammar (GG) is an appropriate formal language for specifying complex systems. In a GG...
AbstractA graph grammar is linear if it generates graphs with at most one nonterminal node. Linear g...
Within the data mining community, there has been a lot of interest the last few years in mining and ...
AbstractThe degree of a graph H is the maximum among the degrees of its nodes. A set of graphs L is ...
Abstract: We investigate sequential derivation languages associated with graph grammars, as a loose ...
DOI
Add to ORKG