1221 search results - page 162 / 245 » Balanced graph partitioning |
138
Voted
NETWORKS
2007
15 years 2 months ago
2007
We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consi...
129
Voted
FOCS
2007
IEEE
15 years 9 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...
158
Voted
WAW
2004
Springer
15 years 8 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...
99
Voted
STOC
2006
ACM
16 years 3 months ago
2006
ACM
We study the fundamental classification problems 0-Extension and Metric Labeling. A generalization of Multiway Cut, 0-Extension is closely related to partitioning problems in grap...
113
Voted
ICCAD
1994
IEEE
15 years 7 months ago
1994
IEEE
We present a general framework for the construction of vertex orderings for netlist clustering. Our WINDOW algorithm constructs an ordering by iteratively adding the vertex with h...