686 search results - page 68 / 138 » Packing Cycles in Graphs |
91
Voted
HPCA
2006
IEEE
16 years 27 days ago
2006
IEEE
We propose dynamic scheduler designs to improve the scheduler scalability and reduce its complexity in the SMT processors. Our first design is an adaptation of the recently propos...
110
Voted
GD
2004
Springer
15 years 6 months ago
2004
Springer
Pinchasi and Radoiˇci´c [11] used the following observation to bound the number of edges of a topological graph without a self-crossing cycle of length 4: if we make a list of t...
89
Voted
COMBINATORICS
2004
15 years 12 days ago
2004
The basic functional equations for connected and 2-connnected graphs can be traced back to the statistical physicists Mayer and Husimi. They play an essential role in establishing...
113
Voted
JGAA
2002
15 years 6 days ago
2002
We address in this paper the problem of constructing embeddings of planar graphs satisfying declarative, user-defined topological constraints. The constraints consist each of a cy...
106
click to vote
WWW
2008
ACM
16 years 1 months ago
2008
ACM
Motivated by several marketplace applications on rapidly growing online social networks, we study the problem of efficient offline matching algorithms for online exchange markets....