Cargando…
A Simple Algorithm for Finding All k-Edge-Connected Components
The problem of finding k-edge-connected components is a fundamental problem in computer science. Given a graph G = (V, E), the problem is to partition the vertex set V into {V (1), V (2),…, V (h)}, where each V (i) is maximized, such that for any two vertices x and y in V (i), there are k edge-disjo...
| Autores principales: | , , , , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Public Library of Science
2015
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4569431/ https://www.ncbi.nlm.nih.gov/pubmed/26368134 http://dx.doi.org/10.1371/journal.pone.0136264 |