The minimum labeling spanning trees (Q1567492): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56077967, #quickstatements; #temporary_batch_1710970253704 |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4040055 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Min-Max Spanning Tree Problem and some extensions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Most and least uniform spanning trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finding the \(k\) smallest spanning trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On finding most uniform spanning trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimum Diameter Spanning Trees and Related Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Single path routing with delay considerations / rank | |||
Normal rank |
Revision as of 16:44, 29 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The minimum labeling spanning trees |
scientific article |
Statements
The minimum labeling spanning trees (English)
0 references
20 June 2000
0 references