Investigating decomposition methods for the maximum common subgraph and sum colouring problems. (Méthodes de décomposition pour les problèmes du plus grand sous-graphe commun et de la somme coloration).
M. Minot. INSA de Lyon, Lyon - Villeurbanne, France, (2017)
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/Minot17
%A Minot, Maël
%D 2017
%K
%T Investigating decomposition methods for the maximum common subgraph and sum colouring problems. (Méthodes de décomposition pour les problèmes du plus grand sous-graphe commun et de la somme coloration).
@phdthesis{phd/hal/Minot17,
added-at = {2023-12-13T04:24:04.000+0100},
author = {Minot, Maël},
biburl = {https://www.bibsonomy.org/bibtex/2052af6bc1ea43689bde1577618890dfa/admin},
ee = {https://tel.archives-ouvertes.fr/tel-01673531},
interhash = {95586c3cb24eb006ad21f0a2adca87ab},
intrahash = {052af6bc1ea43689bde1577618890dfa},
keywords = {},
school = {INSA de Lyon, Lyon - Villeurbanne, France},
timestamp = {2023-12-13T04:24:04.000+0100},
title = {Investigating decomposition methods for the maximum common subgraph and sum colouring problems. (Méthodes de décomposition pour les problèmes du plus grand sous-graphe commun et de la somme coloration).},
year = 2017
}