Efficient algorithms for listing \(k\) disjoint \(st\)-paths in graphs (Q2294713)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient algorithms for listing \(k\) disjoint \(st\)-paths in graphs |
scientific article |
Statements
Efficient algorithms for listing \(k\) disjoint \(st\)-paths in graphs (English)
0 references
12 February 2020
0 references
