Open AccessPendekatan Matriks Ketetanggaan Berbobot untuk Solusi Minimum Spanning Tree (MST)
Author(s) -
Tri Yani Akhirina,
Thomas Afrizal
Publication year - 2020
Publication title -
string (satuan tulisan riset dan inovasi teknologi)
Language(s) - Uncategorized
Resource type - Journals
eISSN - 2549-2837
pISSN - 2527-9661
DOI - 10.30998/string.v4i3.5900
Subject(s) - minimum spanning tree , distributed minimum spanning tree , kruskal's algorithm , spanning tree , k minimum spanning tree , reverse delete algorithm , prim's algorithm , euclidean minimum spanning tree , combinatorics , shortest path tree , connected dominating set , minimum weight , mathematics , minimum degree spanning tree , adjacency matrix , graph , computer science , k ary tree , tree structure , binary tree
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom