Fast Approximation for Computing the Fractional Arboricity of a Graph - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

Fast Approximation for Computing the Fractional Arboricity of a Graph

Abstract

no abstract
No file

Dates and versions

hal-00794903 , version 1 (26-02-2013)

Identifiers

  • HAL Id : hal-00794903 , version 1

Cite

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⟩
69 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More