Edge-disjoint spanning trees and the number of maximum state circles of a graph.

Xiaoling Ma Baoyindureng Wu Xian'an Jin

Published in: J. Comb. Optim. (2018)

Keyphrases

edge disjoint
spanning tree
total length
undirected graph
minimum spanning tree
edge weights
maximum number
running times
minimum spanning trees
neural network
minimum cost
minimum total cost
leaf nodes
depth first search
root node
small number
weighted graph