AbstractWe establish that the finite set of obstructions of a minor-closed set of graphs given by a hyperedge replacement grammar can be effectively constructed. Our proof uses an auxiliary result stating that the system of equations associated with a proper hyperedge replacement grammar has a unique solution
AbstractContext-free hypergraph grammars and boundary graph grammars of bounded nonterminal degree h...
Hyperedge replacement grammar (HRG) is a formalism for generating and transforming graphs that has p...
This paper is intended as a step towards a theoretically sound approach to learning from graphs, by ...
AbstractWe establish that a Vertex Replacement set of graphs, i.e., a set of graphs generated by a C...
AbstractConsider a class C of hyperedge-replacement graph grammars and a numeric function on graphs ...
AbstractThe Graph Minor Theorem of Robertson and Seymour establishes nonconstructively that many nat...
The Graph Minor Theorem of Robertson and Seymour establishes nonconstructively that many natural gra...
AbstractWe introduce the handle-rewriting hypergraph grammars (HH grammars), based on the replacemen...
Topological characterizations of sets of graphs which can be generated by context- free or linear gr...
Communicated by M. Nivat The Graph Minor Theorem of Robertson and Seymour establishes nonconstructiv...
It is well known that hyperedge-replacement grammars can generate NP-complete graph languages even u...
AbstractIn the theory of hyperedge-replacement grammars and languages, one encounters three types of...
. A characterization of the sets of hypertrees generated by hyperedgereplacement graph grammars is e...
Abstract: Hyperedge-replacement grammars and separation-logic formulas both define classes of graph-...
AbstractOnce the set of finite graphs is equipped with an algebra structure (arising from the defini...
AbstractContext-free hypergraph grammars and boundary graph grammars of bounded nonterminal degree h...
Hyperedge replacement grammar (HRG) is a formalism for generating and transforming graphs that has p...
This paper is intended as a step towards a theoretically sound approach to learning from graphs, by ...
AbstractWe establish that a Vertex Replacement set of graphs, i.e., a set of graphs generated by a C...
AbstractConsider a class C of hyperedge-replacement graph grammars and a numeric function on graphs ...
AbstractThe Graph Minor Theorem of Robertson and Seymour establishes nonconstructively that many nat...
The Graph Minor Theorem of Robertson and Seymour establishes nonconstructively that many natural gra...
AbstractWe introduce the handle-rewriting hypergraph grammars (HH grammars), based on the replacemen...
Topological characterizations of sets of graphs which can be generated by context- free or linear gr...
Communicated by M. Nivat The Graph Minor Theorem of Robertson and Seymour establishes nonconstructiv...
It is well known that hyperedge-replacement grammars can generate NP-complete graph languages even u...
AbstractIn the theory of hyperedge-replacement grammars and languages, one encounters three types of...
. A characterization of the sets of hypertrees generated by hyperedgereplacement graph grammars is e...
Abstract: Hyperedge-replacement grammars and separation-logic formulas both define classes of graph-...
AbstractOnce the set of finite graphs is equipped with an algebra structure (arising from the defini...
AbstractContext-free hypergraph grammars and boundary graph grammars of bounded nonterminal degree h...
Hyperedge replacement grammar (HRG) is a formalism for generating and transforming graphs that has p...
This paper is intended as a step towards a theoretically sound approach to learning from graphs, by ...
DOI
Add to ORKG