5607 search results - page 947 / 1122 » Graph structure in the Web |
181
click to vote
PODC
2005
ACM
16 years 3 days ago
2005
ACM
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
184
click to vote
STOC
2004
ACM
15 years 12 months ago
2004
ACM
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and const...
180
click to vote
ESA
2004
Springer
15 years 12 months ago
2004
Springer
Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. A successful lower bound for treewidth is the degeneracy: the maximum over all ...
214
click to vote
FSTTCS
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
208
click to vote
WAW
2004
Springer
15 years 12 months ago
2004
Springer
We develop an algorithm to detect community structure in complex networks. The algorithm is based on spectral methods and takes into account weights and links orientations. Since t...