Open AccessAn exact algorithm fork-cardinality degree constrained clustered minimum spanning tree problem
Author(s) -
T. Jayanth Kumar,
S. Purusotham
Publication year - 2017
Publication title -
iop conference series. materials science and engineering
Language(s) - Uncategorized
Resource type - Journals
eISSN - 1757-899X
pISSN - 1757-8981
DOI - 10.1088/1757-899x/263/4/042112
Subject(s) - minimum spanning tree , spanning tree , degree (music) , kruskal's algorithm , distributed minimum spanning tree , cardinality (data modeling) , mathematics , k minimum spanning tree , connected dominating set , combinatorics , reverse delete algorithm , tree (set theory) , node (physics) , context (archaeology) , euclidean minimum spanning tree , set (abstract data type) , algorithm , minimum weight , k ary tree , computer science , tree structure , binary tree , data mining , paleontology , physics , structural engineering , biology , acoustics , engineering , programming language