Characterizing Compressibility of Disjoint Subgraphs with NLC Grammars

Robert Brijder, Hendrik Blockeel. Characterizing Compressibility of Disjoint Subgraphs with NLC Grammars. In Adrian Horia Dediu, Shunsuke Inenaga, Carlos Martín-Vide, editors, Language and Automata Theory and Applications - 5th International Conference, LATA 2011, Tarragona, Spain, May 26-31, 2011. Proceedings. Volume 6638 of Lecture Notes in Computer Science, pages 167-178, Springer, 2011. [doi]

@inproceedings{BrijderB11,
  title = {Characterizing Compressibility of Disjoint Subgraphs with NLC Grammars},
  author = {Robert Brijder and Hendrik Blockeel},
  year = {2011},
  doi = {10.1007/978-3-642-21254-3_12},
  url = {https://doi.org/10.1007/978-3-642-21254-3_12},
  researchr = {https://researchr.org/publication/BrijderB11},
  cites = {0},
  citedby = {0},
  pages = {167-178},
  booktitle = {Language and Automata Theory and Applications - 5th International Conference, LATA 2011, Tarragona, Spain, May 26-31, 2011. Proceedings},
  editor = {Adrian Horia Dediu and Shunsuke Inenaga and Carlos Martín-Vide},
  volume = {6638},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-21253-6},
}