"Breaking a Graph into Connected Components with Small Dominating Sets."

Matthias Bentert et al. (2024)

> Home

Details and statistics

DOI: 10.4230/LIPICS.MFCS.2024.24

access: open

type: Conference or Workshop Paper

metadata version: 2024-08-26

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/mfcs/BentertFGR024
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mfcs/BentertFGR024
Matthias Bentert, Michael R. Fellows, Petr A. Golovach, Frances A. Rosamond, Saket Saurabh:
Breaking a Graph into Connected Components with Small Dominating Sets. MFCS 2024: 24:1-24:15

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.