1221 search results - page 94 / 245 » Balanced graph partitioning |
EJC
2010
13 years 9 months ago
2010
A conjecture of G. Fan and A. Raspaud asserts that every bridgeless cubic graph contains three perfect matchings with empty intersection. We suggest a possible approach to problem...
IPPS
2002
IEEE
14 years 1 months ago
2002
IEEE
Efficient load balancing algorithms are the key to many efficient parallel applications. Until now, research in this area has mainly been focusing on homogeneous schemes. Howeve...
DAM
2008
13 years 9 months ago
2008
Polar graphs are a common generalization of bipartite, cobipartite, and split graphs. They are defined by the existence of a certain partition of vertices, which is NPcomplete to ...
ISPD
1999
ACM
14 years 1 months ago
1999
ACM
We study alternatives to FM-based partitioning in the context of end-case processing for top-down standard-cell placement. The primary motivation is that small partitioning instan...
IPTPS
2004
Springer
14 years 2 months ago
2004
Springer
—This paper describes a new peer-to-peer protocol that integrates DHT routing, aggregation, allto-all multicast, as well as both topic- and content-based publish/subscribe. In sp...