Login / Signup
The Problem of Finding Several Given Diameter Spanning Trees of Maximum Total Weight in a Complete Graph.
Edward Khairutdinovich Gimadi
Alexandr A. Shtepa
Published in:
AIST (2023)
Keyphrases
</>
spanning tree
total weight
edge weights
edge disjoint
minimum spanning tree
minimum cost
weighted graph
minimum total cost
minimum spanning trees
total length
undirected graph
depth first search
root node
data structure
bayesian networks