Disjoint Path in symmetric Graphs

Aubin Jarry 1, 2 Stéphane Pérennes 2
1 TCS-Sensor Lab [Genève]
2 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 :
Journal articles
Complete list of metadatas
https://hal.inria.fr/hal-00795283
Contributor : Alain Monteil <>
Submitted on : Wednesday, February 27, 2013 - 5:12:30 PM
Last modification on : Monday, November 5, 2018 - 3:36:03 PM

Identifiers

  • HAL Id : hal-00795283, version 1

Collections

UNICE | INRIA | I3S | UNIV-COTEDAZUR

Citation

Aubin Jarry, Stéphane Pérennes. Disjoint Path in symmetric Graphs. Discrete Applied Mathematics, Elsevier, 2009, 157 (1), pp.90-97. ⟨hal-00795283⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

220

Contact


archive-ouverte@inria.fr