Algorithms for square-3PC(*,*)-free Berge graphs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue SIAM Journal on Discrete Mathematics Année : 2008

Algorithms for square-3PC(*,*)-free Berge graphs

Frédéric Maffray
Nicolas Trotignon
Kristina Vuskovic
  • Fonction : Auteur
  • PersonId : 838102

Résumé

We consider the class of graphs containing no odd hole, no odd antihole, and no configuration consisting of three paths between two nodes such that any two of the paths induce a hole, and at least two of the paths are of length 2. This class generalizes claw-free Berge graphs and square-free Berge graphs. We give a combinatorial algorithm of complexity O(n7) to find a clique of maximum weight in such a graph. We also consider several subgraph-detection problems related to this class.

Dates et versions

hal-00258343 , version 1 (21-02-2008)

Identifiants

Citer

Frédéric Maffray, Nicolas Trotignon, Kristina Vuskovic. Algorithms for square-3PC(*,*)-free Berge graphs. SIAM Journal on Discrete Mathematics, 2008, 22 (1), pp.51-71. ⟨10.1137/050628520⟩. ⟨hal-00258343⟩
109 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More