Sciweavers

Share
20 search results - page 2 / 4
» Edge Partitioning in External-Memory Graph Search
Sort
View
ICDE
2010
IEEE
209views Database» more  ICDE 2010»
9 years 1 months ago
Overlapping Community Search for social networks
— 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...
Arnau Padrol-Sureda, Guillem Perarnau-Llobet, Juli...
SIAMDM
2008
84views more  SIAMDM 2008»
8 years 8 months ago
Long Local Searches for Maximal Bipartite Subgraphs
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...
Hemanshu Kaul, Douglas B. West
IPPS
2008
IEEE
9 years 2 months ago
SNAP, Small-world Network Analysis and Partitioning: An open-source parallel graph framework for the exploration of large-scale
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...
David A. Bader, Kamesh Madduri
ICTAI
2010
IEEE
8 years 6 months ago
An Effective Multilevel Memetic Algorithm for Balanced Graph Partitioning
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...
Una Benlic, Jin-Kao Hao
NETWORKS
2010
8 years 6 months ago
A branch-and-cut algorithm for partition coloring
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, . . . ...
Yuri Frota, Nelson Maculan, Thiago F. Noronha, Cel...
books