Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite… 
2008
2008
Abstract. The change pattern and trend of soil moisture (SM) in the Wuding River basin, Loess Plateau, China is explored based on… 
2006
2006
On-line Analytical Processing (OLAP) has become one of the most powerful and prominent technologies for knowledge discovery in… 
2003
2003
It is important for almost all transaction processing and computer-communication systems to satisfy response time quantile… 
2002
2002
The role of carbon (C) and nitrogen (N) interactions on sequestration of atmospheric CO2 in black spruce ecosystems across North… 
2000
2000
Power consumption of digital systems may increase significantly during testing. In this paper, we propose a novel low power… 
2000
2000
We summarize the techniques of implementing move-based hypergraph partitioning heuristics and evaluating their performance in the… 
Highly Cited
1994
Highly Cited
1994
Partitioning graphs into equally large groups of nodes, minimizing the number of edges between different groups, is an extremely… 
1993
1993
Multigrid methods are analyzed in the style of standard iterative methods. A basic error bound is derived in terms of residuals… 
Highly Cited
1991
Highly Cited
1991
A parallel genetic algorithm for the graph partitioning problem is presented which combines general heuris tic algorithms with…