Characterizing Compressibility of Disjoint Subgraphs with NLC Grammars
From MaRDI portal
Publication:3004577
DOI10.1007/978-3-642-21254-3_12zbMath1330.68221OpenAlexW117175422MaRDI QIDQ3004577
Hendrik Blockeel, Robert Brijder
Publication date: 3 June 2011
Published in: Language and Automata Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://lirias.kuleuven.be/handle/123456789/297714
Graph theory (including graph drawing) in computer science (68R10) Grammars and rewriting systems (68Q42)
This page was built for publication: Characterizing Compressibility of Disjoint Subgraphs with NLC Grammars