Results 11  20
of
1,010,187
THE INFLUENCE OF RANDOM NUMBER GENERATORS ON GRAPH PARTITIONING ALGORITHMS
"... Abstract. Many modern heuristic algorithms rely at least in some part on random numbers. Using graph partitioning algorithms as an example, we demonstrate the often underestimated influence of these randomnumber generators on the result of the heuristic algorithms. Even methods that rely on random ..."
Abstract
 Add to MetaCart
Abstract. Many modern heuristic algorithms rely at least in some part on random numbers. Using graph partitioning algorithms as an example, we demonstrate the often underestimated influence of these randomnumber generators on the result of the heuristic algorithms. Even methods that rely on random
Streaming Balanced Graph Partitioning Algorithms for Random Graphs
"... The has been a recent explosion in the size of stored data, partially due to advances in storage technology, and partially due to the growing popularity of cloudcomputing and the vast quantities of data generated, motivates the need for streaming algorithms that can compute approximate solutions wit ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
without full random access to all of the data. We address the problem of computing a balanced kpartitioning of a graph with only one pass over the data. Based on experimental results in [11] we analyze two variants of a randomized greedy algorithm, one that prefers the arg max and one
ยท Worked on various graph partitioning algorithms for image segmentation.
, 2007
"... Theoretical computer science, particularly approximation algorithms and hardness of apResearch Interests proximation; spectral graph theory; linear algebra. ..."
Abstract
 Add to MetaCart
Theoretical computer science, particularly approximation algorithms and hardness of apResearch Interests proximation; spectral graph theory; linear algebra.
Clustering of Defect Reports Using Graph Partitioning Algorithms
"... We present in this paper several solutions to the challenging task of clustering software defect reports. Clustering defect reports can be very useful for prioritizing the testing effort and to better understand the nature of software defects. Despite some challenges with the language used and semi ..."
Abstract
 Add to MetaCart
structured nature of defect reports, our experiments on data collected from the open source project Mozilla show extremely promising results for clustering software defect reports using natural language processing and graph partitioning techniques. We report results with three models for representing the textual
Engineering Edge Ratings and Matching Algorithms for Multilevel Graph Partitioning Algorithms
, 2011
"... The graph partitioning problem is one of the most basic and fundamental problems in theoretical computer science. In fact numerous practical applications exist ranging from the implementation of a VLSI design [15] to the identification of the function a specific gene is responsible for [3]. Though i ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
it can be shown that the balanced graph partition problem is NPcomplete it can often be satisfactorily approximated in very short amount of time. Many modern graph partitioning algorithms use a multilevel scheme, which consists of three phases. First a hierarchy of subsequently coarser graphs is built
Matrix Ordering Strategies for Process Engineering: Graph Partitioning Algorithms for . . .
, 1999
"... The solution of largescale chemical process simulation and optimization problems using parallel computation requires algorithms that can take advantage of multiprocessing when solving the large, sparse matrices that arise. Parallel algorithms require that the matrices be partitioned in order to dis ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
describe here a simple graph partitioning algorithm that creates a bordered blockdiagonal form that is suitable for use with parallel algorithms for the solution of the highly asymmetric sparse matrices arising in process engineering applications. The method aims to create a number of similarly sized
A fast and high quality multilevel scheme for partitioning irregular graphs
 SIAM JOURNAL ON SCIENTIFIC COMPUTING
, 1998
"... Recently, a number of researchers have investigated a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller graph, and then uncoarsen it to construct a partition for the original graph [Bui and Jones, Proc. ..."
Abstract

Cited by 1173 (16 self)
 Add to MetaCart
Recently, a number of researchers have investigated a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller graph, and then uncoarsen it to construct a partition for the original graph [Bui and Jones, Proc.
New Faster KernighanLinType GraphPartitioning Algorithms
 In Proc. IEEE Intl. Conf. ComputerAided Design
, 1993
"... : In this paper we present a very efficient graph partitioning scheme Quick Cut that uses the basic strategy of the KernighanLin (KL) algorithm to swap pairs of nodes to improve an existing partition of a graph G. The main feature of Quick Cut is a "neighborhood search" strategy that is ..."
Abstract

Cited by 24 (2 self)
 Add to MetaCart
: In this paper we present a very efficient graph partitioning scheme Quick Cut that uses the basic strategy of the KernighanLin (KL) algorithm to swap pairs of nodes to improve an existing partition of a graph G. The main feature of Quick Cut is a "neighborhood search" strategy
A CoarseGrain Parallel Formulation of Multilevel kway Graph Partitioning Algorithm
 PARALLEL PROCESSING FOR SCIENTIFIC COMPUTING. SIAM
, 1997
"... In this paper we present a parallel formulation of a multilevel kway graph partitioning algorithm, that is particularly suited for messagepassing libraries that have high latency. The multilevel kway partitioning algorithm reduces the size of the graph by successively collapsing vertices and edge ..."
Abstract

Cited by 45 (0 self)
 Add to MetaCart
In this paper we present a parallel formulation of a multilevel kway graph partitioning algorithm, that is particularly suited for messagepassing libraries that have high latency. The multilevel kway partitioning algorithm reduces the size of the graph by successively collapsing vertices
A local graph partitioning algorithm using heat kernel pagerank
"... Abstract. We give an improved local partitioning algorithm using heat kernel pagerank, a modified version of PageRank. For a subset S with Cheeger ratio (or conductance) h, we show that there are at least a quarter of the vertices in S that can serve as seeds for heat kernel pagerank which lead to l ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
Abstract. We give an improved local partitioning algorithm using heat kernel pagerank, a modified version of PageRank. For a subset S with Cheeger ratio (or conductance) h, we show that there are at least a quarter of the vertices in S that can serve as seeds for heat kernel pagerank which lead
Results 11  20
of
1,010,187