Mining Tractable Sets of Graph Patterns with the Minimum Description Length Principle. (Génération et sélection d'ensembles de motifs de graphes avec le principe MDL).
F. Bariatti. University of Rennes 1, France, (2021)
Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Thesis
%1 phd/hal/Bariatti21
%A Bariatti, Francesco
%D 2021
%K dblp
%T Mining Tractable Sets of Graph Patterns with the Minimum Description Length Principle. (Génération et sélection d'ensembles de motifs de graphes avec le principe MDL).
@phdthesis{phd/hal/Bariatti21,
added-at = {2022-04-01T00:00:00.000+0200},
author = {Bariatti, Francesco},
biburl = {https://www.bibsonomy.org/bibtex/25f96c85b8513b9fe7a1718666f8fa831/dblp},
ee = {https://tel.archives-ouvertes.fr/tel-03523742},
interhash = {fccfe2f66ea2dbdd2a44eb3b3d02abb3},
intrahash = {5f96c85b8513b9fe7a1718666f8fa831},
keywords = {dblp},
school = {University of Rennes 1, France},
timestamp = {2024-04-09T09:05:37.000+0200},
title = {Mining Tractable Sets of Graph Patterns with the Minimum Description Length Principle. (Génération et sélection d'ensembles de motifs de graphes avec le principe MDL).},
year = 2021
}
