Lanean...
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)...
Gorde:
| Argitaratua izan da: | Algorithmica |
|---|---|
| Egile Nagusiak: | , |
| Formatua: | Artigo |
| Hizkuntza: | Inglês |
| Argitaratua: |
Springer US
2020
|
| Gaiak: | |
| Sarrera elektronikoa: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7904754/ https://ncbi.nlm.nih.gov/pubmed/33707803 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/s00453-020-00772-w |
| Etiketak: |
Etiketa erantsi
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!
|