This repository contains source code that I wrote while working on my master's thesis. The objective of this thesis was to compare multiple Minimum Spanning Tree algorithms (which are graph algorithms ...

Graph Theory Implementations This project implements basic graph structures and algorithms, including depth-first search (DFS) and breadth-first search (BFS) for creating spanning trees. Below is an ...

Recently, Knuth and Ciucu independently proved the surprising fact, conjectured by Stanley, that one connected component of the tensor product of a path with itself (the so-called "Aztec diamond graph ...

MST is a tree which has the minimum total edge weight of all possible spanning trees of the original graph. If the brain network can be interpreted as a kind of transport network, an MST might ...

Keywords: MST, graph theory, functional connectivity, PLV, fNIRS, ALS, executive dysfunction Citation: Borgheai SB, McLinden J, Mankodiya K and Shahriari Y (2020) Frontal Functional Network Disruption ...

We contribute to the efficient approximation of the Pareto-set for the classical NP-hard multiobjective minimum spanning tree problem (moMST) adopting evolutionary computation. More precisely, by ...

This paper proposes a graph genetic dynamic minimum spanning tree (DMST) optimization method for the layout designing of large-scale offshore wind farm collector system to minimize total lifecycle ...