Sciweavers

33 search results - page 1 / 7
» C-K-R Partitions of Sparse Graphs
Sort
View
CORR
2008
Springer
147views Education» more  CORR 2008»
13 years 3 months ago
C-K-R Partitions of Sparse Graphs
We present fast algorithms for constructing probabilistic embeddings and approximate distance oracles in sparse graphs. The main ingredient is a fast algorithm for sampling the pr...
Manor Mendel, Chaya Schwob
PC
2008
111views Management» more  PC 2008»
13 years 3 months ago
A partitioning algorithm for block-diagonal matrices with overlap
We present a graph partitioning algorithm that aims at partitioning a sparse matrix into a block-diagonal form, such that any two consecutive blocks overlap. We denote this form o...
Guy Antoine Atenekeng Kahou, Laura Grigori, Masha ...
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
13 years 10 months ago
Sparse Cut Projections in Graph Streams
Finding sparse cuts is an important tool for analyzing large graphs that arise in practice, such as the web graph, online social communities, and VLSI circuits. When dealing with s...
Atish Das Sarma, Sreenivas Gollapudi, Rina Panigra...
ICPP
1995
IEEE
13 years 7 months ago
Multilevel Graph Partitioning Schemes
– In this paper we present experiments with a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller gra...
George Karypis, Vipin Kumar