Polynomial algorithms to finite Veber problem for a tree network (Q1176800): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0377-0427(91)90215-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2091907362 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A note on two problems in connexion with graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the One-Dimensional Space Allocation Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Theorem on Boolean Matrices / rank | |||
Normal rank | |||
Latest revision as of 10:00, 15 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial algorithms to finite Veber problem for a tree network |
scientific article |
Statements
Polynomial algorithms to finite Veber problem for a tree network (English)
0 references
25 June 1992
0 references
This paper presents a polynomial algorithm to a finite Veber problem for a tree network, and the space and time complexity of the algorithm are estimated. For special kinds of graphs the space and time complexity can be reduced. The worked out algorithms and their computer codes can be used for synthesis and development control of oil deposit transportation and communicaton networks.
0 references
polynomial algorithms
0 references
Veber problem
0 references
tree network
0 references
complexity
0 references
