Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,149,027 papers from all fields of science
Search
Sign In
Create Free Account
Graph partition
Known as:
Graph bisection
, GPP
, Partition of a graph
Expand
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
22 relations
Adjacency matrix
Algebraic connectivity
Approximate max-flow min-cut theorem
Arboricity
Expand
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
V. Guruswami
,
A. Sinop
Electron. Colloquium Comput. Complex.
2011
Corpus ID: 7025953
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite…
Expand
2008
2008
Temporal variation of soil moisture over the Wuding River basin assessed with an eco-hydrological model, in-situ observations and remote sensing
Suxia Liu
,
X. Mo
,
+4 authors
L. Mao
2008
Corpus ID: 40952668
Abstract. The change pattern and trend of soil moisture (SM) in the Wuding River basin, Loess Plateau, China is explored based on…
Expand
2006
2006
The cgmCUBE project: Optimizing parallel data cube generation for ROLAP
F. Dehne
,
Todd Eavis
,
A. Rau-Chaplin
Distributed and parallel databases
2006
Corpus ID: 159263
On-line Analytical Processing (OLAP) has become one of the most powerful and prominent technologies for knowledge discovery in…
Expand
2003
2003
HYDRA: HYpergraph-Based Distributed Response-Time Analyzer
N. Dingle
,
P. Harrison
,
W. Knottenbelt
International Conference on Parallel and…
2003
Corpus ID: 5958065
It is important for almost all transaction processing and computer-communication systems to satisfy response time quantile…
Expand
2002
2002
Historical and projected carbon balance of mature black spruce ecosystems across North America: the role of carbon–nitrogen interactions
J. Clein
,
A. McGuire
,
+5 authors
J. Massheder
Plant and Soil
2002
Corpus ID: 12956037
The role of carbon (C) and nitrogen (N) interactions on sequestration of atmospheric CO2 in black spruce ecosystems across North…
Expand
2000
2000
Low power BIST design by hypergraph partitioning: methodology and architectures
P. Girard
,
C. Landrault
,
L. Guiller
,
S. Pravossoudovitch
Proceedings International Test Conference (IEEE…
2000
Corpus ID: 3061392
Power consumption of digital systems may increase significantly during testing. In this paper, we propose a novel low power…
Expand
2000
2000
Design and implementation of move-based heuristics for VLSI hypergraph partitioning
A. Caldwell
,
A. Kahng
,
I. Markov
JEAL
2000
Corpus ID: 2074760
We summarize the techniques of implementing move-based hypergraph partitioning heuristics and evaluating their performance in the…
Expand
Highly Cited
1994
Highly Cited
1994
Genetic algorithms for graph partitioning and incremental graph partitioning
Harpal Maini
,
K. Mehrotra
,
C. Mohan
,
S. Ranka
Proceedings of Supercomputing '94
1994
Corpus ID: 1797386
Partitioning graphs into equally large groups of nodes, minimizing the number of edges between different groups, is an extremely…
Expand
1993
1993
A unified convergence theory for abstract multigrid or multilevel algorithms, serial and parallel
C. Douglas
,
J. Douglas
1993
Corpus ID: 2637403
Multigrid methods are analyzed in the style of standard iterative methods. A basic error bound is derived in terms of residuals…
Expand
Highly Cited
1991
Highly Cited
1991
Intelligent Structural Operators for the k-way Graph Partitioning Problem
G. Laszewski
International Conference on Genetic Algorithms
1991
Corpus ID: 12769105
A parallel genetic algorithm for the graph partitioning problem is presented which combines general heuris tic algorithms with…
Expand
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)
ACCEPT & CONTINUE