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.
2012
2012
Adaptive application offloading using distributed abstract class graphs in mobile environments
2007
2007
An Integrated Memory Array Processor for Embedded Image Recognition Systems
Embedded processors for video image recognition in most cases not only need to address the conventional cost (die size and power… 
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… 
2004
2004
Increase in grain protein percentage in high-yielding common wheat breeding lines by genes from wild tetraploid wheat
SummaryForty-one breeding lines of common wheat, derived from crosses between the Israeli cultivars Miriam and Lakhish and high… 
Review
2003
Review
2003
On graph partitioning, spectral analysis, and digital mesh processing
  • C. Gotsman
  • Shape Modeling International.
  • 2003
  • Corpus ID: 10712129
Partitioning is a fundamental operation on graphs. In this paper we briefly review the basic concepts of graph partitioning and… 
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… 
Highly Cited
2000
Highly Cited
2000
Run-Time Support for Adaptive Load Balancing
Many parallel scientific applications have dynamic and irregular computational structure. However, most such applications exhibit… 
Highly Cited
1999
Highly Cited
1999
Estimating CO2 exchange at two sites in Arctic tundra ecosystems during the growing season using a spectral vegetation index
Measurements of carbon fluxes in Arctic tundra landscapes are generally obtained through intensive field work and involve the use… 
1997
1997
A Graph Partitioning Approach to Sequential Diagnosis
This paper describes a generalized sequential diagnosis algorithm whose analysis leads to strong diagnosability results for a… 
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… 
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)