An algorithm for the most economic link addition in a tree communications network (Q1259541): 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/0020-0190(79)90062-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2008994387 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimum addition of an edge to a path / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimum Communication Spanning Trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Linear algorithms on recursive representations of trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A method and two algorithms on the theory of partitions / rank | |||
Normal rank | |||
Latest revision as of 02:45, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for the most economic link addition in a tree communications network |
scientific article |
Statements
An algorithm for the most economic link addition in a tree communications network (English)
0 references
1979
0 references
tree communication network
0 references
optimization
0 references
depth first search
0 references
graph algorithm
0 references
shortest path
0 references
