Showing cs.DMShow all
2 papers · 1 filter
cs.DM2025
Heuristic algorithms for the stochastic critical node detection problem
Tuguldur Bayarsaikhan, Altannar Chinchuluun, Ashwin Arulselvan +1
Given a network, the critical node detection problem finds a subset of nodes whose removal disrupts the network connectivity. Since many real-world systems are naturally modeled as…
cs.DM2014
Matchings with lower quotas: Algorithms and complexity
Ashwin Arulselvan, Ágnes Cseh, Martin Groß +2
We study a natural generalization of the maximum weight many-to-one matching problem. We are given an undirected bipartite graph with weights on the edges in …