z-logo
open-access-imgOpen Access
Optimizing the minimum spanning tree (MST) and its relationship with the minimum cut
Author(s) -
Safa Mohamed Hadi Al Kafaji,
Mushtak A. K. Shiker
Publication year - 2022
Publication title -
international journal of health sciences
Language(s) - English
Resource type - Journals
eISSN - 2550-6978
pISSN - 2550-696X
DOI - 10.53730/ijhs.v6ns6.12436
Subject(s) - minimum spanning tree , spanning tree , kruskal's algorithm , mathematics , combinatorics , minimum weight , reverse delete algorithm , minimum cut , shortest path tree , path (computing) , graph , distributed minimum spanning tree , cutoff , minimum degree spanning tree , tree (set theory) , discrete mathematics , computer science , physics , quantum mechanics , programming language

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom