"Complexity and inapproximability results for balanced connected subgraph ..."

Timothée Martinod et al. (2021)

> Home

Details and statistics

DOI: 10.1016/J.TCS.2021.07.010

access: closed

type: Journal Article

metadata version: 2021-09-16

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tcs/MartinodPDGK21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/MartinodPDGK21
Timothée Martinod, Valentin Pollet, Benoît Darties, Rodolphe Giroudeau, Jean-Claude König:
Complexity and inapproximability results for balanced connected subgraph problem. Theor. Comput. Sci. 886: 69-83 (2021)

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.