Heuristics for finding a maximum number of disjoint bounded paths (Q3695028): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Latest revision as of 18:08, 14 June 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
