"The Balanced Connected Subgraph Problem: Complexity Results in ..."

Benoît Darties et al. (2019)

> Home

Details and statistics

DOI: 10.1007/978-3-030-36412-0_36

access: closed

type: Conference or Workshop Paper

metadata version: 2019-12-12

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/cocoa/DartiesGKP19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cocoa/DartiesGKP19
Benoît Darties, Rodolphe Giroudeau, Jean-Claude König, Valentin Pollet:
The Balanced Connected Subgraph Problem: Complexity Results in Bounded-Degree and Bounded-Diameter Graphs. COCOA 2019: 449-460

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.