Approximating the sparsest $k$-subgraph in chordal graph

Journal article

Peer reviewed

Theory of Computing Systems, Vol.58(1), pp.111-132

09/03/2016

Abstract

Approximation algorithm

Sparsest k-subgraph

Chordal graphs

url

Find in HALView

1 Record Views

Title: Approximating the sparsest $k$-subgraph in chordal graph
Creators - without role: Rémi Watrigant - Methods, Algorithms for Operations REsearch
Marin Bougeret - Algorithmes, Graphes et Combinatoire
Rodolphe Giroudeau - Methods, Algorithms for Operations REsearch
Publication Details: Theory of Computing Systems, Vol.58(1), pp.111-132
Identifiers: 9945044709311
Academic Unit: Laboratoire d'Informatique de Robotique et de Microélectronique de Mtp - LIRMM
Language: English
Resource Type: Journal article
Local Fields: lirmm-01383119