Skip to Main content Skip to Navigation
Theses

Algorithmes exacts et exponentiels sur les graphes : énumération, comptage et optimisation

Abstract : The assumption that many problems do not admit algorithm (exact and deterministic) polynomial ate of the advent of the theory of NP-completeness in the 70s. Since many theories and algorithmic techniques have been developed to solve these problems difficult as efficiently as possible. In this thesis, we focus on exact algorithms weakly exponential. The objective is to obtain algorithms complexity 0 * (c ^ n) where n is the size of the data and one constant c as small as possible
Document type :
Theses
Complete list of metadata

Cited literature [99 references]  Display  Hide  Download

https://hal.univ-lorraine.fr/tel-01749404
Contributor : Thèses Ul <>
Submitted on : Thursday, March 29, 2018 - 12:15:22 PM
Last modification on : Thursday, October 24, 2019 - 4:00:04 PM
Long-term archiving on: : Friday, September 14, 2018 - 9:31:10 PM

File

DDOC_T_2012_0325_COUTURIER.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : tel-01749404, version 1

Collections

Citation

Jean-François Couturier. Algorithmes exacts et exponentiels sur les graphes : énumération, comptage et optimisation. Autre [cs.OH]. Université de Lorraine, 2012. Français. ⟨NNT : 2012LORR0325⟩. ⟨tel-01749404⟩

Share

Metrics

Record views

70

Files downloads

64