Computing capacitated minimal spanning trees efficiently (Q4071024): 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.3230040403 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2074744922 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the shortest spanning subtree of a graph and the traveling salesman problem / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 17:13, 12 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Computing capacitated minimal spanning trees efficiently |
scientific article |
Statements
Computing capacitated minimal spanning trees efficiently (English)
0 references
1974
0 references