20 citations · 66 across the 52 of their papers we have counts for
4 papers · 1 filter
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…
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…
Plane and Planarity Thresholds for Random Geometric Graphs
Ahmad Biniaz, Evangelos Kranakis, Anil Maheshwari +1
A random geometric graph, , is formed by choosing points independently and uniformly at random in a unit square; two points are connected by a straight-line edge if the…
Improved Methods For Generating Quasi-Gray Codes
Dana Jansens, Prosenjit Bose, Paz Carmi +3
Consider a sequence of bit strings of length d, such that each string differs from the next in a constant number of bits. We call this sequence a quasi-Gray code. We examine the pr…