Algebraic structures such as groups, rings and modules provide a rigorous framework for organising and manipulating mathematical objects. Graph theory, concerned with vertices connected by edges, has ...

Graph algorithms for spanning structures encompass a family of techniques designed to extract sparse subgraphs that preserve essential connectivity and distance properties of the original network.

Discrete mathematics is the study of finite or countable discrete structures; it spans such topics as graph theory, coding theory, design theory, and enumeration. The faculty at Michigan Tech ...

Discrete structures are omnipresent in mathematics, computer science, statistical physics, optimisation and models of natural phenomena. For instance, complex random graphs serve as a model for social ...

Abstract: Multi-view clustering (MVC) with bipartite graph has been extensively studied to rapidly handle multi-source heterogeneous information via sparse anchors. However, most existing methods ...

This repository contains the official code for our MICCAI 2025 paper, “Semantically Consistent Discrete Diffusion for 3D Biological Graph Generation.” We introduce a discrete diffusion framework that ...

The Department has a strong faculty working in various topics in discrete mathematics, especially algorithmic aspects. The interface between Theoretical Computer Science and Discrete Mathematics has ...

Discrete Mathematics is a subject that has gained prominence in recent times. Unlike regular Maths, where we deal with real numbers that vary continuously, Discrete Mathematics deals with logic that ...

Abstract: Through optimizing discrete labels directly, discrete clustering technique enables to address potential information loss issue in spectral clustering caused by multi-stage label processing.