Sciweavers

244 search results - page 26 / 49
» Balanced Cayley graphs and balanced planar graphs
Sort
View
ASPDAC
2010
ACM
637views Hardware» more  ASPDAC 2010»
13 years 7 months ago
A new graph-theoretic, multi-objective layout decomposition framework for double patterning lithography
As Double Patterning Lithography(DPL) becomes the leading candidate for sub-30nm lithography process, we need a fast and lithography friendly decomposition framework. In this pape...
Jae-Seok Yang, Katrina Lu, Minsik Cho, Kun Yuan, D...
ICGA
1993
296views Optimization» more  ICGA 1993»
13 years 10 months ago
A Genetic Algorithm Applied to the Maximum Flow Problem
A genetic algorithms is applied to find a maximum flow from the source to sink in a weighted directed graph, where the weight associated with each edge represents its flow capacit...
Toshinori Munakata, David J. Hashier
PPOPP
2010
ACM
14 years 6 months ago
A distributed placement service for graph-structured and tree-structured data
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
Gregory Buehrer, Srinivasan Parthasarathy, Shirish...
STOC
2001
ACM
132views Algorithms» more  STOC 2001»
14 years 9 months ago
Edge isoperimetry and rapid mixing on matroids and geometric Markov chains
We show how to bound the mixing time and log-Sobolev constants of Markov chains by bounding the edge-isoperimetry of their underlying graphs. To do this we use two recent techniqu...
Ravi Montenegro, Jung-Bae Son
STOC
2007
ACM
117views Algorithms» more  STOC 2007»
14 years 9 months ago
A combinatorial, primal-dual approach to semidefinite programs
Semidefinite programs (SDP) have been used in many recent approximation algorithms. We develop a general primal-dual approach to solve SDPs using a generalization of the well-know...
Sanjeev Arora, Satyen Kale