"Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs."

Petr A. Golovach, Pinar Heggernes, Dieter Kratsch (2015)

> Home

Details and statistics

DOI: 10.1007/978-3-319-29516-9_20

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/iwoca/GolovachHK15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iwoca/GolovachHK15
Petr A. Golovach, Pinar Heggernes, Dieter Kratsch:
Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs. IWOCA 2015: 235-247

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.