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

Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-02083527
Contributor : Bastien Doreau <>
Submitted on : Friday, March 29, 2019 - 10:01:50 AM
Last modification on : Tuesday, January 21, 2020 - 1:14:14 AM

Links full text

Identifiers

Collections

Citation

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⟩

Share

Metrics

Record views

30