20 search results - page 2 / 4 » Edge Partitioning in External-Memory Graph Search |
ICDE
2010
IEEE
13 years 9 months ago
2010
IEEE
— Finding decompositions of a graph into a family of clusters is crucial to understanding its underlying structure. While most existing approaches focus on partitioning the nodes...
SIAMDM
2008
13 years 4 months ago
2008
Given a partition of the vertices of a graph into two sets, a flip is a move of a vertex from its own set to the other, under the condition that it has more incident edges to vert...
IPPS
2008
IEEE
13 years 11 months ago
2008
IEEE
We present SNAP (Small-world Network Analysis and Partitioning), an open-source graph framework for exploratory study and partitioning of large-scale networks. To illustrate the c...
ICTAI
2010
IEEE
13 years 2 months ago
2010
IEEE
The balanced graph partitioning consists in dividing the vertices of an undirected graph into a given number of subsets of approximately equal size, such that the number of edges c...
NETWORKS
2010
13 years 2 months ago
2010
Let G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1, . . . , Qq} is a partition of V into q subsets. We refer to Q1, . . . ...