New algorithms to compute the strength of a graph - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2008

New algorithms to compute the strength of a graph

Résumé

We investigate the problem of computing the strength of a graph. We describe in this article the first polyhedral formulation for the weighted strength in polynomial size of the problem, that is O(mn), where n is the number of vertices and m the number of edges. Moreover, we describe a surprisingly simple FPTAS that gives the strength within 1+epsilon in time O(m log^2(n) log(m/n)/epsilon^2) and space O(m), outperforming by a factor of roughly min(n\sqrt{m},n^5/3) the best known exact algorithm of Trubin associated with the Goldberg and Rao maxflow algorithm for that problem, and of roughly sigma(G) the FPTAS of Plotkin, Shmoys, and Tardos.
Fichier principal
Vignette du fichier
RR-6592.pdf (242.46 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

inria-00305560 , version 1 (24-07-2008)
inria-00305560 , version 2 (29-07-2008)

Identifiants

  • HAL Id : inria-00305560 , version 1

Citer

Jérôme Galtier. New algorithms to compute the strength of a graph. [Research Report] RR-6592, 2008, pp.17. ⟨inria-00305560v1⟩

Collections

INRIA-RRRT
198 Consultations
184 Téléchargements

Partager

Gmail Facebook X LinkedIn More