1951 search results - page 68 / 391 » An algorithm for improving graph partitions |
164
click to vote
ICPP
1997
IEEE
15 years 8 months ago
1997
IEEE
Abstract—This paper describes an algorithm for deriving data and computation partitions on scalable shared memory multiprocessors. The algorithm establishes affinity relationshi...
139
click to vote
STACS
2010
Springer
15 years 11 months ago
2010
Springer
The Graph Isomorphism problem restricted to graphs of bounded treewidth or bounded tree distance width are known to be solvable in polynomial time [2],[19]. We give restricted spa...
188
click to vote
WAW
2010
Springer
15 years 1 months ago
2010
Springer
We give an improved algorithm for computing personalized PageRank vectors with tight error bounds which can be as small as (n-p ) for any fixed positive integer p. The improved Pag...
ICCAD
2002
IEEE
16 years 28 days ago
2002
IEEE
– In this paper we present multi-objective hMetis partitioning for simultaneous cutsize and circuit delay minimization. We change the partitioning process itself by introducing a...
129
click to vote
ICDM
2008
IEEE
15 years 10 months ago
2008
IEEE
While data mining in chemoinformatics studied graph data with dozens of nodes, systems biology and the Internet are now generating graph data with thousands and millions of nodes....