Cargando…
The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths
This paper revisits the classical edge-disjoint paths (EDP) problem, where one is given an undirected graph G and a set of terminal pairs P and asks whether G contains a set of pairwise edge-disjoint paths connecting every terminal pair in P. Our aim is to identify structural properties (parameters)...
| Autores principales: | , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Springer US
2020
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7904754/ https://www.ncbi.nlm.nih.gov/pubmed/33707803 http://dx.doi.org/10.1007/s00453-020-00772-w |