Results 1  10
of
260,233
Analysis of Multilevel Graph Partition Algorithm
"... All the recent available graph partitioning packages include the multilevel graph partition algorithm in which the graph is coarsened by a sequence of increasingly smaller graphs. The smallest graph is partitioned using a graph partitioning algorithm and this partition is propagated back through th ..."
Abstract
 Add to MetaCart
All the recent available graph partitioning packages include the multilevel graph partition algorithm in which the graph is coarsened by a sequence of increasingly smaller graphs. The smallest graph is partitioned using a graph partitioning algorithm and this partition is propagated back through
Engineering Multilevel Graph Partitioning Algorithms
"... We present a multilevel graph partitioning algorithm using novel local improvement algorithms and global search strategies transferred from multigrid linear solvers. Local improvement algorithms are based on maxflow mincut computations and more localized FM searches. By combining these technique ..."
Abstract

Cited by 28 (14 self)
 Add to MetaCart
We present a multilevel graph partitioning algorithm using novel local improvement algorithms and global search strategies transferred from multigrid linear solvers. Local improvement algorithms are based on maxflow mincut computations and more localized FM searches. By combining
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
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.
Multilevel algorithms for partitioning powerlaw graphs
 IEEE INTERNATIONAL PARALLEL & DISTRIBUTED PROCESSING SYMPOSIUM (IPDPS). IN
, 2006
"... Graph partitioning is an enabling technology for parallel processing as it allows for the effective decomposition of unstructured computations whose data dependencies correspond to a large sparse and irregular graph. Even though the problem of computing highquality partitionings of graphs arising i ..."
Abstract

Cited by 58 (0 self)
 Add to MetaCart
in scientific computations is to a large extent wellunderstood, this is far from being true for emerging HPC applications whose underlying computation involves graphs whose degree distribution follows a powerlaw curve. This paper presents new multilevel graph partitioning algorithms that are specifically
Community detection in graphs
, 2009
"... The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices of th ..."
Abstract

Cited by 801 (1 self)
 Add to MetaCart
The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices
Planning Algorithms
, 2004
"... This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning ..."
Abstract

Cited by 1108 (51 self)
 Add to MetaCart
This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning
AN n 5/2 ALGORITHM FOR MAXIMUM MATCHINGS IN BIPARTITE GRAPHS
, 1973
"... The present paper shows how to construct a maximum matching in a bipartite graph with n vertices and m edges in a number of computation steps proportional to (m + n)x/. ..."
Abstract

Cited by 712 (1 self)
 Add to MetaCart
The present paper shows how to construct a maximum matching in a bipartite graph with n vertices and m edges in a number of computation steps proportional to (m + n)x/.
A Framework for Dynamic Graph Drawing
 CONGRESSUS NUMERANTIUM
, 1992
"... Drawing graphs is an important problem that combines flavors of computational geometry and graph theory. Applications can be found in a variety of areas including circuit layout, network management, software engineering, and graphics. The main contributions of this paper can be summarized as follows ..."
Abstract

Cited by 627 (44 self)
 Add to MetaCart
as follows: ffl We devise a model for dynamic graph algorithms, based on performing queries and updates on an implicit representation of the drawing, and we show its applications. ffl We present several efficient dynamic drawing algorithms for trees, seriesparallel digraphs, planar stdigraphs, and planar
Results 1  10
of
260,233