1 citations · 2 across the 3 of their papers we have counts for
3 papers
math.CO2026
Interchange graphs of (0,1)-matrices are maximally Hamiltonian
Jeffrey S. Baggett, Huiya Yan
For integer vectors R,S let A(R,S) denote the class of (0,1)-matrices with row sum vector R and column sum vector S. Its interchange graph G(R,S) has A(R,S) as its vertex set, two…
cs.IT2015★ 1 cited
General Capacity for Deterministic Dissemination in Wireless Ad Hoc Networks
Cheng Wang, Jieren Zhou, Tianci Liu +4
In this paper, we study capacity scaling laws of the deterministic dissemination (DD) in random wireless networks under the generalized physical model (GphyM). This is truly not a…
cs.SI2013★ 1 cited
Measuring Transport Difficulty of Data Dissemination in Large-Scale Online Social Networks: An Interest-Driven Case
Cheng Wang, Zhenzhen Zhang, Jieren Zhou +3
In this paper, we aim to model the formation of data dissemination in online social networks (OSNs), and measure the transport difficulty of generated data traffic. We focus on a u…