Heuristics for finding a maximum number of disjoint bounded paths (Q3695028): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.3230140405 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2119337515 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 19: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
