The problem is to find a minimal k-edge-connected spanning subgraph of a graph G. A connected graph is k-edge-connected if it remains connected whenever fewer than k edges are removed. This repository ...

Complex networks represent interconnected systems found in fields ranging from sociology to biology and technological infrastructures. A critical aspect of analysing such networks is the study of ...

Abstract: Finding whether a graph is k-connected, and the identification of its k-connected components is a fundamental problem in graph theory. For this reason, there have been several algorithms for ...

This repository contains MATLAB scripts used in studies of random spanning trees on quantum annealers with a Chimera topology (e.g., old D-Wave systems). These scripts were developed as part of ...

I'm wrapping up a discrete math course for my university. The last chapter gave us an introduction to graph theory, and I want to learn more. The chapter in question introduced some basic concepts: ...

Abstract: Cognitive deficits in each brain are likely to be associated with alterations in brain connectivity. Given the vast number of connections, studying and identifying these changes is neither ...