Showing cs.DMShow all
3 papers · 1 filter
cs.DM2026
Completely Independent Steiner Trees
Anil Maheshwari, Karthik Murali, Michiel Smid
Spanning trees are fundamental for efficient communication in networks. For fault-tolerant communication, it is desirable to have multiple spanning trees to ensure resilience again…
cs.DM2025
Cops and Robbers for Graphs on Surfaces with Crossings
Prosenjit Bose, Pat Morin, Karthik Murali
Cops and Robbers is a game played on a graph where a set of cops attempt to capture a single robber. The game proceeds in rounds, where each round first consists of the cops' turn,…
cs.DM2024
On 1-Planar Graphs with Bounded Cop-Number
Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari +1
Cops and Robbers is a type of pursuit-evasion game played on a graph where a set of cops try to capture a single robber. The cops first choose their initial vertex positions, and l…