On the complexity of computing the k-restricted edge-connectivity of a graph

Luis Pedro Montejano 1 Ignasi Sau 2
2 ALGCO - Algorithmes, Graphes et Combinatoire
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Document type :
Journal articles
Complete list of metadatas

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01481786
Contributor : Ignasi Sau <>
Submitted on : Thursday, March 2, 2017 - 9:50:38 PM
Last modification on : Friday, April 12, 2019 - 10:18:10 AM

Links full text

Identifiers

Collections

Citation

Luis Pedro Montejano, Ignasi Sau. On the complexity of computing the k-restricted edge-connectivity of a graph. Theoretical Computer Science, Elsevier, 2017, 662, pp.31-39. ⟨10.1016/j.tcs.2016.12.006⟩. ⟨lirmm-01481786⟩

Share

Metrics

Record views

201