On Finding the Optimal Tree of a Complete Weighted Graph
Saved in:
| Main Authors: | Seyed Soheil Hosseini, Nick Wormald, Tianhai Tian |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Polish Information Processing Society
2020-09-01
|
| Series: | Annals of computer science and information systems |
| Online Access: | https://annals-csis.org/Volume_21/drp/pdf/4.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Gallai-Ramsey numbers for rainbow trees and monochromatic complete bipartite graphs
by: Luyi Li, et al.
Published: (2025-01-01) -
Exact algorithm for the problem of the minimum complete spanning tree of a divisible multiple graph
by: Alexander V. Smirnov
Published: (2025-06-01) -
NP-completeness of the Minimum Spanning Tree Problem of a Multiple Graph of Multiplicity k ≥ 3
by: Alexander Valeryevich Smirnov
Published: (2021-03-01) -
Ramsey numbers for a large tree versus multiple copies of complete graphs of different sizes
by: Sinan Hu, et al.
Published: (2025-01-01) -
A Paradigmatic Approach to Find Equal Sum Partitions of Zero-Divisors via Complete Graphs
by: M. Haris Mateen, et al.
Published: (2022-01-01)