23 citations · 42 across the 17 of their papers we have counts for
Showing cs.DCShow all
3 papers · 1 filter
cs.DC2007★ 1 cited
Nearest Neighbor Network Traversal
David Pritchard
A mobile agent in a network wants to visit every node of an n-node network, using a small number of steps. We investigate the performance of the following ``nearest neighbor'' heur…
cs.DC2007
Fast Computation of Small Cuts via Cycle Space Sampling
David Pritchard, Ramakrishna Thurimella
We describe a new sampling-based method to determine cuts in an undirected graph. For a graph (V, E), its cycle space is the family of all subsets of E that have even degree at eac…
cs.DC2006
An Optimal Distributed Edge-Biconnectivity Algorithm
David Pritchard
We describe a synchronous distributed algorithm which identifies the edge-biconnected components of a connected network. It requires a leader, and uses messages of size O(log |V|).…