"Étude de complexité algorithmique pour des problèmes ..."

Timothée Martinod (2023)

> Home

Details and statistics

DOI: —

access: closed

type: Book or Thesis

metadata version: 2024-03-20

- view
  - electronic edition @ archives-ouvertes.fr
- export record
  dblp key:
  - phd/hal/Martinod23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/phd/hal/Martinod23
Timothée Martinod:
Étude de complexité algorithmique pour des problèmes de domination et de tournées dans les graphes avec obligations. (Algorithmic complexity study for domination and routing problems in graphs with obligations). University of Clermont Auvergne, Clermont-Ferrand, France, 2023

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.