688 search results - page 54 / 138 » General Partitioning on Random Graphs |
109
Voted
CORR
2008
Springer
15 years 16 days ago
2008
Springer
We present a deterministic way of assigning small (log bit) weights to the edges of a bipartite planar graph so that the minimum weight perfect matching becomes unique. The isolati...
92
Voted
DAC
2008
ACM
16 years 1 months ago
2008
ACM
Many computational tools have recently begun to benefit from the use of the symmetry inherent in the tasks they solve, and use general-purpose graph symmetry tools to uncover this...
87
Voted
CIKM
2009
Springer
15 years 7 months ago
2009
Springer
We propose a General Markov Framework for computing page importance. Under the framework, a Markov Skeleton Process is used to model the random walk conducted by the web surfer on...
130
Voted
CORR
2006
Springer
15 years 15 days ago
2006
Springer
We provide a tight approximate characterization of the n-dimensional product multicommodity flow (PMF) region for a wireless network of n nodes. Separate characterizations in term...
113
Voted
CCS
2010
ACM
14 years 11 months ago
2010
ACM
Social network-based Sybil defenses exploit the trust exhibited in social graphs to detect Sybil nodes that disrupt an algorithmic property (i.e., the fast mixing) in these graphs...