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

From MaRDI portal
Publication:501666

DOI10.1016/j.tcs.2016.12.006zbMath1356.68107arXiv1502.07659OpenAlexW2576039262MaRDI QIDQ501666

Luis Pedro Montejano, Ignasi Sau

Publication date: 9 January 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1502.07659




Related Items (5)



Cites Work


This page was built for publication: On the complexity of computing the \(k\)-restricted edge-connectivity of a graph