You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output.
Click here to find out more.
Chapter title |
On the Complexity of Computing the k-restricted Edge-connectivity of a Graph
|
---|---|
Chapter number | 16 |
Book title |
Graph-Theoretic Concepts in Computer Science
|
Published by |
Springer, Berlin, Heidelberg, June 2015
|
DOI | 10.1007/978-3-662-53174-7_16 |
Book ISBNs |
978-3-66-253173-0, 978-3-66-253174-7
|
Authors |
Luis Pedro Montejano, Ignasi Sau |