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.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01511357
Contributor : Léo Planche <>
Submitted on : Thursday, September 14, 2017 - 8:12:18 PM
Last modification on : Thursday, December 19, 2019 - 1:23:01 AM
Long-term archiving on: Friday, December 15, 2017 - 11:39:24 PM

File

hublaminar.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01511357, version 2

Citation

Etienne Birmelé, Fabien de Montgolfier, Léo Planche, Laurent Viennot. Decomposing a Graph into Shortest Paths with Bounded Eccentricity. 2017. ⟨hal-01511357v2⟩

Share

Metrics

Record views

481

Files downloads

648