Finding small simple cycle separators for 2-connected planar graphs
Journal of Computer and System Sciences
Partitioning sparse matrices with eigenvectors of graphs
SIAM Journal on Matrix Analysis and Applications
Introduction to parallel computing: design and analysis of algorithms
Introduction to parallel computing: design and analysis of algorithms
A Cartesian Parallel Nested Dissection Algorithm
SIAM Journal on Matrix Analysis and Applications
Modification of the minimum-degree algorithm by multiple elimination
ACM Transactions on Mathematical Software (TOMS)
Computer Solution of Large Sparse Positive Definite
Computer Solution of Large Sparse Positive Definite
Further improve circuit partitioning using GBAW logic perturbation techniques
Proceedings of the conference on Design, automation and test in Europe
Graph-partitioning based instruction scheduling for clustered processors
Proceedings of the 34th annual ACM/IEEE international symposium on Microarchitecture
Sourcebook of parallel computing
Further improve circuit partitioning using GBAW logic perturbation techniques
IEEE Transactions on Very Large Scale Integration (VLSI) Systems - Special section on the 2001 international conference on computer design (ICCD)
Instruction Replication for Clustered Microarchitectures
Proceedings of the 36th annual IEEE/ACM International Symposium on Microarchitecture
Removing communications in clustered microarchitectures through instruction replication
ACM Transactions on Architecture and Code Optimization (TACO)
Exploiting symmetry for partitioning models in parallel discrete event simulation
Proceedings of the eighteenth workshop on Parallel and distributed simulation
BLINKS: ranked keyword searches on graphs
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Heterogeneous Clustered VLIW Microarchitectures
Proceedings of the International Symposium on Code Generation and Optimization
Keyword search on external memory data graphs
Proceedings of the VLDB Endowment
Boosting single-thread performance in multi-core systems through fine-grain multi-threading
Proceedings of the 36th annual international symposium on Computer architecture
Parallelising a simulator for the analysis of electromagnetic radiation using MUMPS library
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
Application of fusion-fission to the multi-way graph partitioning problem
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Finite Elements in Analysis and Design
Multilevel algorithms for partitioning power-law graphs
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Comparing clustering and metaclustering algorithms
MLDM'11 Proceedings of the 7th international conference on Machine learning and data mining in pattern recognition
Answering subgraph queries over large graphs
WAIM'11 Proceedings of the 12th international conference on Web-age information management
High-performance reconfigurable computer systems
PaCT'11 Proceedings of the 11th international conference on Parallel computing technologies
Adaptive application offloading using distributed abstract class graphs in mobile environments
Journal of Systems and Software
Approximate weighted matching on emerging manycore and multithreaded architectures
International Journal of High Performance Computing Applications
Multi-threaded nested filtering factorization preconditioner
PARA'12 Proceedings of the 11th international conference on Applied Parallel and Scientific Computing
The impact of tangled code changes
Proceedings of the 10th Working Conference on Mining Software Repositories
Efficient data partitioning model for heterogeneous graphs in the cloud
SC '13 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
G-tree: an efficient index for KNN search on road networks
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Multimedia Tools and Applications
| Hi-index | 0.00 |
Recently, a number of researchers have investigated a class of algorithms that are based on multilevel graph partitioning that have moderate computational complexity, and provide excellent graph partitions. However, there exists little theoretical analysis that could explain the ability of multilevel algorithms to produce good partitions. In this paper we present such an analysis. Weshow under certain reasonable assumptions that even if no refinement is used in the uncoarsening phase, a good bisection of the coarser graph is worse than a good bisection of the finer graph by at most a small factor. We also show that for planar graphs, the size of a good vertex-separator of the coarse graph projected to the finer graph (without performing refinement in the uncoarsening phase) is higher than the size of a good vertex-separator of the finer graph by at most a small factor.