Heuristics for finding a maximum number of disjoint bounded paths (Q3695028)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3920232
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Heuristics for finding a maximum number of disjoint bounded paths |
scientific article; zbMATH DE number 3920232 |
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
0.798751950263977
0 references
0.791660726070404
0 references
0.7876502871513367
0 references
0.7858189344406128
0 references
