Showing cs.DMShow all
2 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
On Separating Path and Tree Systems in Graphs
Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel +6
We explore the concept of separating systems of vertex sets of graphs. A separating system of a set is a collection of subsets of such that for any pair of distinct element…