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.
2008
2008
Abstract. The change pattern and trend of soil moisture (SM) in the Wuding River basin, Loess Plateau, China is explored based on… 
2007
2007
Embedded processors for video image recognition in most cases not only need to address the conventional cost (die size and power… 
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… 
Highly Cited
2000
Highly Cited
2000
Many parallel scientific applications have dynamic and irregular computational structure. However, most such applications exhibit… 
2000
2000
We summarize the techniques of implementing move-based hypergraph partitioning heuristics and evaluating their performance in the… 
Highly Cited
1999
Highly Cited
1999
Measurements of carbon fluxes in Arctic tundra landscapes are generally obtained through intensive field work and involve the use… 
1997
1997
This paper describes a generalized sequential diagnosis algorithm whose analysis leads to strong diagnosability results for a… 
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…