3 papers
cs.DS2026
Maximum Matching on Regular Nonbipartite Graphs
Varsha Dani, Thomas P. Hayes, Seth Pettie
Blocking flow-type maximum matching algorithms are based on finding maximal sets of shortest augmenting paths. They run in time, on both bipartite [HK73, Din70, Kar7…
cs.DC2025
Energy-Efficient Maximal Independent Sets in Radio Networks
Dominick Banasik, Varsha Dani, Fabien Dufoulon +3
The maximal independent set (MIS) is one of the most fundamental problems in distributed computing, and it has been studied intensively for over four decades. This paper focuses on…
cs.DC2024
Low-Distortion Clustering in Bounded Growth Graphs
Yi-Jun Chang, Varsha Dani, Thomas P. Hayes
The well-known clustering algorithm of Miller, Peng, and Xu (SPAA 2013) is useful for many applications, including low-diameter decomposition and low-energy distributed algorithms.…