1951 search results - page 157 / 391 » An algorithm for improving graph partitions |
165
click to vote
IPPS
1999
IEEE
15 years 9 months ago
1999
IEEE
By managing network resources at compile time, the compiled communication technique greatly improves the communication performance for communication patterns that are known at com...
176
click to vote
FAW
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. Given a graph G and a nonnegative integer k, the NP-complete Induced Matching problem asks for an edge subset M such that M is a matching and no two edges of M are joined...
149
click to vote
INFOVIS
2002
IEEE
15 years 10 months ago
2002
IEEE
We present an extremely fast graph drawing algorithm for very large graphs, which we term ACE (for Algebraic multigrid Computation of Eigenvectors). ACE exhibits an improvement of...
156
click to vote
ALGORITHMICA
2004
15 years 4 months ago
2004
We consider the Chromatic Sum Problem on bipartite graphs which appears to be much harder than the classical Chromatic Number Problem. We prove that the Chromatic Sum Problem is NP...
148
click to vote
CGF
2006
15 years 5 months ago
2006
We present a novel algorithm to compute cache-efficient layouts of bounding volume hierarchies (BVHs) of polygonal models. Our approach does not make any assumptions about the cac...