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...
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...
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 ...
Tinaz Ekim, Pavol Hell, Juraj Stacho, Dominique de...
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...
Andrew E. Caldwell, Andrew B. Kahng, Igor L. Marko...
—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...