Algorithmes exacts et exponentiels pour les problèmes NP-difficiles sur les graphes et hypergraphes. (Exact Exponential-Time Algorithms for NP-hards Problems on Graphs and Hypergraphs)

Manfred Cochefert. Algorithmes exacts et exponentiels pour les problèmes NP-difficiles sur les graphes et hypergraphes. (Exact Exponential-Time Algorithms for NP-hards Problems on Graphs and Hypergraphs). PhD thesis, University of Lorraine, Nancy, France, 2014. [doi]

@phdthesis{hal-10605,
  title = {Algorithmes exacts et exponentiels pour les problèmes NP-difficiles sur les graphes et hypergraphes. (Exact Exponential-Time Algorithms for NP-hards Problems on Graphs and Hypergraphs)},
  author = {Manfred Cochefert},
  year = {2014},
  url = {https://tel.archives-ouvertes.fr/tel-01751574},
  researchr = {https://researchr.org/publication/hal-10605},
  cites = {0},
  citedby = {0},
  school = {University of Lorraine, Nancy, France},
}