Results 1  10
of
1,454,392
Complexity of Graph Partition Problems
 31ST ANNUAL ACM STOC
, 1999
"... We introduce a parametrized family of graph problems that includes several wellknown graph partition problems as special cases. We develop tools which allow us to classify the complexity of many problems in this family, and in particular lead us to a complete classification for small values of the ..."
Abstract

Cited by 21 (4 self)
 Add to MetaCart
We introduce a parametrized family of graph problems that includes several wellknown graph partition problems as special cases. We develop tools which allow us to classify the complexity of many problems in this family, and in particular lead us to a complete classification for small values
A graph partition problem
, 2014
"... Given a graph G on n vertices, for which m is it possible to partition the edge set of the mfold complete graph mKn into copies of G? We show that there is an integer m0, which we call the partition modulus of G, such that the set M(G) of values of m for which such a partition exists consists of ..."
Abstract
 Add to MetaCart
Given a graph G on n vertices, for which m is it possible to partition the edge set of the mfold complete graph mKn into copies of G? We show that there is an integer m0, which we call the partition modulus of G, such that the set M(G) of values of m for which such a partition exists consists
Parameterized Algorithms for Graph Partitioning Problems
"... Abstract. We study a broad class of graph partitioning problems, where each problem is specified by a graph G=(V,E), and parameters k and p. We seek a subset U⊆V of size k, such that α1m1+α2m2 is at most (or at least) p, where α1,α2∈R are constants defining the problem, and m1,m2 are the cardinaliti ..."
Abstract
 Add to MetaCart
Abstract. We study a broad class of graph partitioning problems, where each problem is specified by a graph G=(V,E), and parameters k and p. We seek a subset U⊆V of size k, such that α1m1+α2m2 is at most (or at least) p, where α1,α2∈R are constants defining the problem, and m1,m2
SumMax Graph Partitioning Problem
"... In this paper we consider the classical combinatorial optimization graph partitioning problem, with SumMax as objective function. Given a weighted graph G = (V, E) and a integer k, our objective k j=i+1 is to find a kpartition (V1,..., Vk) of V that minimizes ∑k−1 i=1 max u∈Vi,v∈Vj w(u, v), where ..."
Abstract
 Add to MetaCart
In this paper we consider the classical combinatorial optimization graph partitioning problem, with SumMax as objective function. Given a weighted graph G = (V, E) and a integer k, our objective k j=i+1 is to find a kpartition (V1,..., Vk) of V that minimizes ∑k−1 i=1 max u∈Vi,v∈Vj w(u, v
Path Optimization for Graph Partitioning Problems
 Discrete Applied Mathematics. Combinatorial Algorithms, Optimization and Computer Science
, 1998
"... This paper presents a new heuristic for graph partitioning called Path Optimization (PO), and the results of an extensive set of empirical comparisons of the new algorithm with two very wellknown algorithms for partitioning: the KernighanLin algorithm and simulated annealing. Our experiments are ..."
Abstract

Cited by 13 (2 self)
 Add to MetaCart
This paper presents a new heuristic for graph partitioning called Path Optimization (PO), and the results of an extensive set of empirical comparisons of the new algorithm with two very wellknown algorithms for partitioning: the KernighanLin algorithm and simulated annealing. Our experiments
A Graph Partitioning Problem for MultipleChip Design
 PROC. INTL. SYMPOSIUM ON CIRCUITS AND SYSTEMS
, 1993
"... In this paper, we introduce a new graph partitioning problem that stems from a multiplechip design style in which there is a chip library of chips containing predesigned circuit components (e.g. adders, multipliers etc) which are frequently used. Given an arbitrary circuit data flow graph, we have ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
In this paper, we introduce a new graph partitioning problem that stems from a multiplechip design style in which there is a chip library of chips containing predesigned circuit components (e.g. adders, multipliers etc) which are frequently used. Given an arbitrary circuit data flow graph, we have
Directed Metrics and Directed Graph Partitioning Problems
 In Proc. of SODA, 2006
"... The theory of embeddings of finite metrics has provided a powerful toolkit for graph partitioning problems in undirected graphs. The connection comes from the fact that the integrality gaps of mathematical programming relaxations for sparsest cut in undirected graphs is exactly equal to the minimum ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
The theory of embeddings of finite metrics has provided a powerful toolkit for graph partitioning problems in undirected graphs. The connection comes from the fact that the integrality gaps of mathematical programming relaxations for sparsest cut in undirected graphs is exactly equal to the minimum
SEMIDEFINITE PROGRAMMING RELAXATIONS FOR THE GRAPH PARTITIONING PROBLEM
, 1999
"... A new semidefinite programming, SDP, relaxation for the general graph partitioning problem, GP, is derived. The relaxation arises from the dual of the (homogenized) Lagrangian dual of an appropriate quadratic representation of GP. The quadratic representation includes a representation of the 0,1 co ..."
Abstract

Cited by 31 (6 self)
 Add to MetaCart
A new semidefinite programming, SDP, relaxation for the general graph partitioning problem, GP, is derived. The relaxation arises from the dual of the (homogenized) Lagrangian dual of an appropriate quadratic representation of GP. The quadratic representation includes a representation of the 0
MOVEBASED CROSSOVER FOR GRAPH PARTITIONING PROBLEMS
"... Abstract. This paper introduces a specialized crossover operator for use in graph partitioning problems. The article starts with a short introduction to the graph partitioning problem and its formulation as a multiobjective task. Thereafter a suitable genetic representation, that is capable of ig ..."
Abstract
 Add to MetaCart
Abstract. This paper introduces a specialized crossover operator for use in graph partitioning problems. The article starts with a short introduction to the graph partitioning problem and its formulation as a multiobjective task. Thereafter a suitable genetic representation, that is capable
Results 1  10
of
1,454,392