HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Reports

Stable set meeting every longest paths

Frédéric Havet 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
Abstract : Laborde, Payan and Xuong conjectured that every digraph has a stable set meeting every longest path. We prove that this conjecture holds for digraphs with stability at most 2.
Document type :
Reports
Complete list of metadata

Cited literature [1 references]  Display  Hide  Download

https://hal.inria.fr/inria-00071575
Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Tuesday, May 23, 2006 - 6:00:59 PM
Last modification on : Friday, February 4, 2022 - 3:11:27 AM
Long-term archiving on: : Sunday, April 4, 2010 - 10:26:18 PM

Identifiers

  • HAL Id : inria-00071575, version 1

Collections

Citation

Frédéric Havet. Stable set meeting every longest paths. RR-5009, INRIA. 2003. ⟨inria-00071575⟩

Share

Metrics

Record views

137

Files downloads

94