A note on finding optimum branchings (Q3867580): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Paolo M. Camerini / rank | |||
| Property / author | |||
| Property / author: Paolo M. Camerini / rank | |||
Normal rank | |||
| 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.3230090403 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2096389124 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Thek best spanning arborescences of a network / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimum branchings / rank | |||
Normal rank | |||
Latest revision as of 03:37, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on finding optimum branchings |
scientific article |
Statements
A note on finding optimum branchings (English)
0 references
1979
0 references
finding optimum branchings
0 references
Tarjan's algorithm
0 references
directed graph
0 references
