Results 1 to 10 of about 29,070 (246)
Growing Graphs with Hyperedge Replacement Graph Grammars [PDF]
Proceedings of the 25th ACM International on Conference on Information and Knowledge Management, 2016 Discovering the underlying structures present in large real world graphs is a fundamental scientific problem. In this paper we show that a graph's clique tree can be used to extract a hyperedge replacement grammar.
Aguinaga S. +4 more
core +2 more sources
Compressing graphs by grammars [PDF]
2016 IEEE 32nd International Conference on Data Engineering (ICDE), 2016 We present a new graph compressor that detects repeating substructures and represents them by grammar rules. We show that for a large number of graphs the compressor obtains smaller representations than other approaches. For RDF graphs and version graphs it outperforms the best known previous methods.
Maneth, Sebastian, Peternek, Fabian
openaire +1 more source
Towards Translating Graph Transformation Approaches by Model Transformations [PDF]
, 2006 Recently, many researchers are working on semantics preserving model transformation. In the field of graph transformation one can think of translating graph grammars written in one approach to a behaviourally equivalent graph grammar in another approach.
Frank Hermann +10 more
core +5 more sources
CoRR, 2020 We propose the use of hyperedge replacement graph grammars for factor graphs, or factor graph grammars (FGGs) for short. FGGs generate sets of factor graphs and can describe a more general class of models than plate notation, dynamic graphical models, case-factor diagrams, and sum-product networks can.
David Chiang 0001, Darcey Riley
openaire +3 more sources
Graph Grammars, Insertion Lie Algebras, and Quantum Field Theory [PDF]
, 2015 Graph grammars extend the theory of formal languages in order to model distributed parallelism in theoretical computer science. We show here that to certain classes of context-free and context-sensitive graph grammars one can associate a Lie algebra ...
Marcolli, Matilde, Port, Alexander
core +3 more sources
Event-driven grammars: Relating abstract and concrete levels of visual languages [PDF]
, 2007 The final publication is available at Springer via http://dx.doi.org/10.1007/s10270-007-0051-2In this work we introduce event-driven grammars, a kind of graph grammars that are especially suited for visual modelling environments generated by meta ...
Guerra, Esther, Lara, Juan de
core +2 more sources
Probabilistic regular graphs [PDF]
, 2010 Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extension of regular graphs obtained by labelling the terminal arcs of the graph ...
Bertrand, Nathalie, Morvan, Christophe
core +5 more sources
Translating Controlled Graph Grammars to Ordinary Graph Grammars
Electronic Notes in Theoretical Computer Science, 2016 AbstractGraph Grammar (GG) is an appropriate formal language for specifying complex systems. In a GG the system states are represented by graphs and the changes between the states are described by rules. The use of GGs is interesting as there are several techniques for the specification and verification of systems that are described in this language ...
Alex Bertei +2 more
openaire +1 more source
Grammar-based graph compression [PDF]
Information Systems, 2018 We present a new graph compressor that works by recursively detecting repeated substructures and representing them through grammar rules. We show that for a large number of graphs the compressor obtains smaller representations than other approaches.
Sebastian Maneth, Fabian Peternek
openaire +2 more sources
A complete system of grammars for plane graphs [PDF]
, 1979 In [1], for directed graphs, it was shown that the system of simple graph grammars is complete. In this paper, a system of grammars for plane graphs, called plane graph grammars, is introduced, and it is shown that this system is complete, ..
Uesu Tadahiro
core +1 more source