Login / Signup
On Several Edge-Disjoint MSTs with Given Diameter in Undirected Graph with Exponentially Distributed Edge Weights.
Eduard Kh. Gimadi
Alexandr S. Shevyakov
Aleksandr A. Shtepa
Published in:
AIST (Supplement) (2021)
Keyphrases
</>
spanning tree
edge disjoint
edge weights
undirected graph
minimum spanning tree
minimum cost
weighted graph
minimum weight
graph clustering
satisfy the triangle inequality
approximation algorithms
image processing
natural images
level set
multi dimensional
object recognition
multimedia