Heuristics for finding a maximum number of disjoint bounded paths (Q3695028): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:29, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Heuristics for finding a maximum number of disjoint bounded paths |
scientific article |
Statements
Heuristics for finding a maximum number of disjoint bounded paths (English)
0 references
1984
0 references
design of communication networks
0 references
maximum number of vertex disjoint paths
0 references
polynomial heuristic algorithm
0 references
