2 papers
cs.DS2026
Multi-tier Flexible Graph Connectivity
Karthekeyan Chandrasekaran, Raymond Jiang, Krishna Kalathur
Motivated by non-uniform edge failures in network design, we introduce a multi-tier model of flexible graph connectivity. In k-tier Flexible Graph Connectivity (k-tier FGC), the in…
cs.DS2026
Polynomial-time Stable Matching in Network Hypergraphs
Karthekeyan Chandrasekaran, Krishna Kalathur
We show that there exists a polynomial-time algorithm to find a stable matching in network hypergraphic preference systems. The key connection that drives the algorithm was discove…