Characterizing compressibility of disjoint subgraphs with NLC grammars

Authors:
Robert Brijder;Hendrik Blockeel
Affiliations:
Leiden Institute of Advanced Computer Science, Universiteit Leiden, The Netherlands;Leiden Institute of Advanced Computer Science, Universiteit Leiden, The Netherlands and Department of Computer Science, Katholieke Universiteit Leuven, Belgium
Venue:
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Year:
2011

Citing 4
Cited 0

Graph Grammars Based on Node Rewriting: An Introduction to NLC Graph Grammars

Proceedings of the 4th International Workshop on Graph-Grammars and Their Application to Computer Science
Inference of node replacement graph grammars

Intelligent Data Analysis
A stochastic graph grammar for compositional object representation and recognition

Pattern Recognition
Substructure discovery using minimum description length and background knowledge

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider compression of a given set S of isomorphic and disjoint subgraphs of a graph G using node labelled controlled (NLC) graph grammars. Given S and G, we characterize whether or not there exists a NLC graph grammar consisting of exactly one rule such that (1) each of the subgraphs S in G are compressed (i.e., replaced by a nonterminal) in the (unique) initial graph I, and (2) the set of generated terminal graphs is the singleton {G}.