Graph partition

Known as: Graph bisection, GPP, Partition of a graph 
In mathematics, the graph partition problem is defined on data represented in the form of a graph G = (V,E), with V vertices and E edges, such that… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2006
Highly Cited
2006
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on… (More)
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Many vision tasks, such as segmentation, grouping, and recognition can be formulated as graph partition problems. The recent… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
We present a new method for transductive learning, which can be seen as a transductive version of the k nearest-neighbor… (More)
  • figure 1
  • table 2
  • table 1
  • figure 2
  • figure 4
Is this relevant?
Highly Cited
2001
Highly Cited
2001
An important application of graph partitioning is data clustering using a,graph model the pairwise similarities between all data… (More)
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Both document clustering and word clustering are well studied problems. Most existing algorithms cluster documents and words… (More)
Is this relevant?
Highly Cited
1999
Highly Cited
1999
The NP-hard graph bisection problem is to partition the nodes of an undirected graph into two equal-sized groups so as to… (More)
  • table 1
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Recently, a number of researchers have investigated a class of graph partitioning algorithms that reduce the size of the graph by… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
1996
Highly Cited
1996
In this paper we present a parallel formulation of a multilevel k-way graph partitioning algorithm. The multilevel k-way… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1995
Highly Cited
1995
The graph partitioning problem is that of dividing the vertices of a graph into sets of specified sizes such that few edges cross… (More)
Is this relevant?
Highly Cited
1989
Highly Cited
1989
In this and two companion papers, we report on an extended empirical study of the simulated annealing approach to combinatorial… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?