An Exact Algorithm to Check the Existence of (Elementary) Paths and a Generalisation of the Cut Problem in Graphs with Forbidden Transitions - Université Clermont Auvergne Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

An Exact Algorithm to Check the Existence of (Elementary) Paths and a Generalisation of the Cut Problem in Graphs with Forbidden Transitions

Dates et versions

hal-02083527 , version 1 (29-03-2019)

Identifiants

Citer

Mamadou Moustapha Kanté, Christian Laforest, Benjamin Momège. An Exact Algorithm to Check the Existence of (Elementary) Paths and a Generalisation of the Cut Problem in Graphs with Forbidden Transitions. SOFSEM 2013: Theory and Practice of Computer Science, 2013, Špindlerův Mlýn, Czech Republic. pp.257--267, ⟨10.1007/978-3-642-35843-2_23⟩. ⟨hal-02083527⟩
10 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More