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)

Related topics

Related topics

22 relations
Adjacency matrixAlgebraic connectivityApproximate max-flow min-cut theoremArboricity

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Quadratic Integer Programming with PSD Objectives
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite… 
2008
2008
Temporal variation of soil moisture over the Wuding River basin assessed with an eco-hydrological model, in-situ observations and remote sensing
Abstract. The change pattern and trend of soil moisture (SM) in the Wuding River basin, Loess Plateau, China is explored based on… 
2006
2006
The cgmCUBE project: Optimizing parallel data cube generation for ROLAP
On-line Analytical Processing (OLAP) has become one of the most powerful and prominent technologies for knowledge discovery in… 
2003
2003
HYDRA: HYpergraph-Based Distributed Response-Time Analyzer
It is important for almost all transaction processing and computer-communication systems to satisfy response time quantile… 
2002
2002
Historical and projected carbon balance of mature black spruce ecosystems across North America: the role of carbon–nitrogen interactions
The role of carbon (C) and nitrogen (N) interactions on sequestration of atmospheric CO2 in black spruce ecosystems across North… 
2000
2000
Low power BIST design by hypergraph partitioning: methodology and architectures
Power consumption of digital systems may increase significantly during testing. In this paper, we propose a novel low power… 
2000
2000
Design and implementation of move-based heuristics for VLSI hypergraph partitioning
We summarize the techniques of implementing move-based hypergraph partitioning heuristics and evaluating their performance in the… 
Highly Cited
1994
Highly Cited
1994
Genetic algorithms for graph partitioning and incremental graph partitioning
Partitioning graphs into equally large groups of nodes, minimizing the number of edges between different groups, is an extremely… 
1993
1993
A unified convergence theory for abstract multigrid or multilevel algorithms, serial and parallel
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
Intelligent Structural Operators for the k-way Graph Partitioning Problem
A parallel genetic algorithm for the graph partitioning problem is presented which combines general heuris tic algorithms with… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)