Skip to Main content Skip to Navigation
Conference papers

Fast Approximation for Computing the Fractional Arboricity of a Graph

Mikaila Worou Toko 1 
1 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Résumé : no abstract
Document type :
Conference papers
Complete list of metadata

https://hal.inria.fr/hal-00794903
Contributor : Alain Monteil Connect in order to contact the contributor
Submitted on : Tuesday, February 26, 2013 - 4:33:41 PM
Last modification on : Saturday, June 25, 2022 - 11:09:49 PM

Identifiers

  • HAL Id : hal-00794903, version 1

Collections

Citation

Mikaila Worou Toko. Fast Approximation for Computing the Fractional Arboricity of a Graph. Conference on Optimal Discrete Structures and Algorithms (ODSA), 2010, Rostock, Germany, Germany. ⟨hal-00794903⟩

Share

Metrics

Record views

65