Decomposing a Graph into Shortest Paths with Bounded Eccentricity

Abstract : We introduce the problem of hub-laminar decomposition which generalizes that of computing a shortest path with minimum eccentricity. It consists in decomposing a graph into several paths that collectively have small eccentricity and meet only near their extremities. The problem is also related to that of binning appearing in biology in the context of metagenomics. We show that a graph having such a decomposition with sufficient long paths can be decomposed with approximated guar-anties on the parameters of the decomposition.
Type de document :
Pré-publication, Document de travail
MAP5 2017-18. 2017
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01511357
Contributeur : Léo Planche <>
Soumis le : jeudi 14 septembre 2017 - 20:12:18
Dernière modification le : mardi 10 octobre 2017 - 11:22:05

Fichier

hublaminar.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01511357, version 2

Collections

Citation

Etienne Birmelé, Fabien De Montgolfier, Léo Planche, Laurent Viennot. Decomposing a Graph into Shortest Paths with Bounded Eccentricity. MAP5 2017-18. 2017. 〈hal-01511357v2〉

Partager

Métriques

Consultations de
la notice

36

Téléchargements du document

18