Results 1  10
of
46,391
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 24 (5 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
Simple algorithms for graph partition problems
 DEPT. OF MATH. AND COMPUT. SCI., TOKYO INST. OF TECH
, 2005
"... Based on the Belief Propagation Method, we propose simple and deterministic algorithms for some NPhard graph partitioning problems, such as the Most Likely Partition problem and the Graph Bisection problem. These algorithms run in O(n + m) or O((n + m) log n) time on graphs with n vertices and m ed ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Based on the Belief Propagation Method, we propose simple and deterministic algorithms for some NPhard graph partitioning problems, such as the Most Likely Partition problem and the Graph Bisection problem. These algorithms run in O(n + m) or O((n + m) log n) time on graphs with n vertices and m
Parameterized Algorithms for Graph Partitioning Problems
, 2014
"... 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 cardinalities of the ..."
Abstract
 Add to MetaCart
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 cardinalities
SumMax Graph Partitioning Problem
, 2012
"... 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 12 (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
Improved Approximation Algorithms for Maximum Graph Partitioning Problems
 J. Comb. Optim
, 2005
"... Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAXkCUT, MAXkUNCUT, MAXkDIRECTEDCUT, MAXkDIRECTEDUNCUT, MAXkDENSESUBGRAPH, and MAXkVERTEXCOVER. It was observed by ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAXkCUT, MAXkUNCUT, MAXkDIRECTEDCUT, MAXkDIRECTEDUNCUT, MAXkDENSESUBGRAPH, and MAXkVERTEXCOVER. It was observed by
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
Results 1  10
of
46,391