"Efficient enumeration algorithms for minimal graph completions and ..."

Caroline Brosse (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/Brosse23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/phd/hal/Brosse23
Caroline Brosse:
Efficient enumeration algorithms for minimal graph completions and deletions. (Algorithmes d'énumération efficaces pour les complétions et délétions minimales de graphes). University of Clermont Auvergne, Clermont-Ferrand, France, 2023

a service of

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.