Login / Signup
Determining possible sets of leaves for spanning trees of dually chordal graphs.
Pablo De Caria
Marisa Gutierrez
Published in:
Ars Comb. (2015)
Keyphrases
</>
spanning tree
undirected graph
minimum spanning tree
minimum spanning trees
minimum cost
edge disjoint
minimum weight
weighted graph
minimum total cost
depth first search
random graphs
directed graph
adjacency matrix
root node
definite clause