5889 search results - page 177 / 1178 » Graph Layout Problems |
188
Voted
ASPDAC
2006
ACM
16 years 9 days ago
2006
ACM
This paper advances a new methodology based on signal-path information to resolve the problem of device-level placement for analog layout. This methodology is mainly based on three...
189
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
This paper concerns the management of energy in data centers using a cyber-physical model that supports the coordinated control of both computational and thermal (cooling) resource...
168
Voted
FCT
2007
Springer
15 years 10 months ago
2007
Springer
We study the multi-dimensional version of the bin packing problem with conflicts. We are given a set of squares V = {1, 2, . . . , n} with sides s1, s2, . . . , sn [0, 1] and a co...
164
click to vote
ICALP
2000
Springer
15 years 10 months ago
2000
Springer
We give an O(n log n) algorithm for computing the girth (shortest cycle) of an undirected n-vertex planar graph. Our solution extends to any graph of bounded genus. This improves u...
143
click to vote
WSR
2008
15 years 7 months ago
2008
: TGraphs are directed graphs with typed, attributed, and ordered nodes and edges. These properties leverage the use of graphs as models for all kinds of artifacts in the context o...