Skip to Main content Skip to Navigation
Journal articles

Complexity and inapproximability results for balanced connected subgraph problem

Timothée Martinod 1 Valentin Pollet 1 Benoit Darties 1 Rodolphe Giroudeau 1 Jean-Claude König 1 
1 MAORE - Méthodes Algorithmes pour l'Ordonnancement et les Réseaux
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Document type :
Journal articles
Complete list of metadata

https://hal-lirmm.ccsd.cnrs.fr/lirmm-03475313
Contributor : Isabelle Gouat Connect in order to contact the contributor
Submitted on : Friday, December 10, 2021 - 5:40:13 PM
Last modification on : Tuesday, January 4, 2022 - 6:06:53 AM

Identifiers

Collections

Citation

Timothée Martinod, Valentin Pollet, Benoit Darties, Rodolphe Giroudeau, Jean-Claude König. Complexity and inapproximability results for balanced connected subgraph problem. Theoretical Computer Science, Elsevier, 2021, 886, pp.69-83. ⟨10.1016/j.tcs.2021.07.010⟩. ⟨lirmm-03475313⟩

Share

Metrics

Record views

6