This repo focus on the problem of finding a minimum spanning tree of an undirected graph. Implemented a parallel algorithm for finding the minimum spanning tree of an undirected graph using whatever ...

The number of spanning trees is a parameter of architectural and dynamic proprieties of a graph. Computing spanning trees of a graph is a NP-hard problem in graph theory. Algorithms counting this ...

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

Gao, Pu , Xavier Pérez-Giménez, and Cristiane M Sato. 2014. “Arboricity And Spanning-Tree Packing In Random Graphs With An Application To Load Balancing”. In Proceedings Of The Twenty-Fifth Annual Acm ...

This work is devoted to the problem of spanning trees maintenance in the presence of crash failures in a distributed environment using only local knowledge. Using a pre-constructed spanning tree of a ...

RICHARD W. KENYON, DAVID B. WILSON, SPANNING TREES OF GRAPHS ON SURFACES AND THE INTENSITY OF LOOP-ERASED RANDOM WALK ON PLANAR GRAPHS, Journal of the American Mathematical Society, Vol. 28, No. 4 ...

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 ...