236 search results - page 32 / 48 » Graphs, partitions and Fibonacci numbers |
SIAMDM
2010
13 years 7 months ago
2010
We study grooming for two-period optical networks, a variation of the traffic grooming problem for WDM ring networks introduced by Colbourn, Quattrocchi, and Syrotiuk. In the two-...
CORR
2011
Springer
13 years 27 days ago
2011
Springer
Many online networks are measured and studied via sampling techniques, which typically collect a relatively small fraction of nodes and their associated edges. Past work in this a...
FOCS
2007
IEEE
14 years 3 months ago
2007
IEEE
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
WAW
2004
Springer
14 years 2 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...
FOCS
2003
IEEE
14 years 2 months ago
2003
IEEE
We consider the problem of clustering a collection of elements based on pairwise judgments of similarity and dissimilarity. Bansal, Blum and Chawla (in: Proceedings of 43rd FOCS, ...