4 citations · 8 across the 3 of their papers we have counts for
3 papers
cs.GT2016★ 4 cited
Approximation of barter exchanges with cycle length constraints
Suiqian Luo, Pingzhong Tang, Chenggang Wu +1
We explore the clearing problem in the barter exchange market. The problem, described in the terminology of graph theory, is to find a set of vertex-disjoint, length-restricted cyc…
cs.DC2004
ReCord: A Distributed Hash Table with Recursive Structure
Jianyang Zeng, Wen-Jing Hsu
We propose a simple distributed hash table called ReCord, which is a generalized version of Randomized-Chord and offers improved tradeoffs in performance and topology maintenance o…
cs.DM2004★ 4 cited
Near Optimal Routing for Small-World Networks with Augmented Local Awareness
Jianyang Zeng, Wen-Jing Hsu, Jiangdian Wang
In order to investigate the routing aspects of small-world networks, Kleinberg proposes a network model based on a -dimensional lattice with long-range links chosen at random ac…