作者: Robert Brijder , Hendrik Blockeel
DOI: 10.1007/978-3-642-21254-3_12
关键词:
摘要: We consider compression of a given set S isomorphic and disjoint subgraphs graph G using node labelled controlled (NLC) grammars. Given G, we characterize whether or not there exists NLC grammar consisting exactly one rule such that (1) each the in are compressed (i.e., replaced by nonterminal) (unique) initial I, (2) generated terminal graphs is singleton {G}.