44 search results - page 1 / 9 » Clique Partitions, Graph Compression, and Speeding-Up Algori... |
STOC
1991
ACM
13 years 8 months ago
1991
ACM
WSDM
2009
ACM
13 years 11 months ago
2009
ACM
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
WEA
2005
Springer
13 years 10 months ago
2005
Springer
PARA
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. This paper presents new efficient parallel algorithms for finding approximate solutions to graph coloring problems. We consider an existing shared memory parallel graph...
DCC
2008
IEEE
14 years 4 months ago
2008
IEEE
We introduce an EDIF netlist graph algorithm which is lossy with respect to the original byte stream but lossless in terms of the circuit information it contains based on a graph ...