"Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and ..."

Jean-François Couturier et al. (2012)

> Home

Details and statistics

DOI: 10.1007/978-3-642-27660-6_17

access: closed

type: Conference or Workshop Paper

metadata version: 2021-10-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/sofsem/CouturierHHK12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sofsem/CouturierHHK12
Jean-François Couturier, Pinar Heggernes, Pim van 't Hof, Dieter Kratsch:
Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration. SOFSEM 2012: 202-213

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.