77 search results - page 8 / 16 » A Note on the Asymptotics and Computational Complexity of Gr... |
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
In both distributed counting and queuing, processors in a distributed system issue operations which are organized into a total order. In counting, each processor receives the rank...
PODC
2011
ACM
12 years 10 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
CPM
2009
Springer
14 years 2 months ago
2009
Springer
A sequence of reversals that takes a signed permutation to the identity is perfect if it preserves all common intervals between the permutation and the identity. The problem of com...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
COMPLEX
2009
Springer
14 years 2 months ago
2009
Springer
To probe network characteristics, two predominant ways of network comparison are global property statistics and subgraph enumeration. However, they suffer from limited information...