References
- KumarVGramaAGuptaAKarypisGIntroduction to Parallel Computing: Design and Analysis of Algorithms1994
- HendricksonBKoldaTGGraph partitioning models for parallel computingParall Comput2000261519153410.1016/S0167-8191(00)00048-X
- GeorgeALiuJWHComputer Solution of Large Sparse Positive Definite Systems1981
- GuptaAKarypisGKumarVHighly scalable parallel algorithms for sparse matrix factorizationIEEE Trans Parall Distr1997850252010.1109/71.598277
- KarypisGAggarwalRKumarVShekharSMultilevel hypergraph partitioning: application in VLSI domainProceedings of the Design and Automation Conference.1997526529
- SelimHMManufacturing cell formation problem: a graph partitioning approachInd Mngt Data Syst200210234135210.1108/02635570210432046
- KarypisGKumarVA Software Package for Partitioning Unstructured Graphs, Partitioning Meshes, and Computing Fill-reducing Orderings of Sparse Matrices, Version 3.0.31997
- KarypisGKumarVA fast and high quality multilevel scheme for partitioning irregular graphsSIAM J Sci Comput19982035939210.1137/S1064827595287997
- KarypisGKumarVMultilevel k-way partitioning scheme for irregular graphsJ Parall Distr Comm1998989612910.1006/jpdc.1997.1404
- MonienBPreisRDiekmannRQuality matching and local improvement for multilevelgraph-partitioningParall Comput2000261609163410.1016/S0167-8191(00)00049-1
- WalshawCCrossMMesh partitioning: a multilevel balancing and refinement algorithmSIAM J Sci Comput200022638010.1137/S1064827598337373
- BouhmalaNCaiXPartition of unstructured finite element meshes by a multilevel approachProceedings of Applied Parallel Computing2001187195
- BanosRGilCOrtegaJMontoyaFGMultilevel heuristic algorithm for graph partitioningApplications of Evolutionary Computing2003143153
- OuyangMToulouseMThulasiramanKGloverFDeogunJSMultilevel cooperative search for the circuit/hypergraph partitioning problemIEEE T Comput Aid D20022168569310.1109/TCAD.2002.1004312
- MitchellMAn Introduction to Genetic Algorithms1996
- GareyMRJohnsonDSComputers and Intractability1979
- BuiTNPeckAPartitioning planar graphsSIAM J Comput19922120321510.1137/0221016
- CormenTHLeisersonCERivestRLIntroduction to Algorithms1998
- FeigeUKrauthgamerRA polylogarithmic approximation of the minimum bisectionSIAM J Comput2002311090111810.1137/S0097539701387660
- KernighanBLinSAn efficient heuristic procedure for partitioning graphsBell Syst Tech J19704929130710.1002/j.1538-7305.1970.tb01770.x
- KirkpatrickSGelattCDVecchiMPOptimization by simulated annealingScience1983220459867168010.1126/science.220.4598.671
- JohnsonDSAragonCMcGeochLSchevonCOptimization by simulated annealing: an experimental evaluation: part 1, graph partitioningOprs Res19893786589210.1287/opre.37.6.865
- BuiTNChaudhurhSLeightonFTSipserMGraph bisection algorithms with good average case behaviorCombinatorica1987717119110.1007/BF02579448
- BuiTNHeighamCJonesCLeightonTImproving the performance of the Kernighan–Lin and simulated annealing graph bisection algorithmsProceedings of the 26th ACM/IEEE Design Automation Conference1989775778
- JonesCVertex and edge partitions of graphs1992
- CohoonJPMartinWNRichardsDSA multi-population genetic algorithm for solving the k-partition problem on hyber-cubesProceedings of the Fourth International Conference on Genetic Algorithms1991244248
- CollinsRJeffersonDSelection in massively parallel genetic algorithmsProceedings of the Fourth International Conference on Genetic Algorithms1991249256
- LaszewskiGIntelligent structural operators for the k-way graph partitioning problemProceedings of the Fourth International Conference on Genetic Algorithms19914552
- SaabYGRaoVBStochastic evolution: a fast effective heuristic for some genetic layout problemsProceedings of 27th ACM/IEEE Design Automation Conference19912631
- BuiTNMoonBRGRCA: a hybrid genetic algorithm for circuit ratio-cut partitioningIEEE T Comput Aid D19981719320410.1109/43.700718
- ShazelySBarakaHAbdel-WahabAKamalHGenetic algorithms in solving graph partitioning problemMultiple Approaches to Intelligent Systems (Proceedings)1999155164
- RaoARMRaoTVSRADattaguruBAutomatic decomposition of unstructured meshes employing genetic algorithms for parallel FEM computationsStruct Eng Mech20021462564710.12989/sem.2002.14.6.625
- KohmotoKKatayamaKNarihisaHPerformance of a genetic algorithm for the graph partitioning problemMath Comput Model2003381325133210.1016/S0895-7177(03)90134-8
- HendricksonBLelandRA multilevel algorithm for partitioning graphs1993
- BuiTJonesCA heuristic for reducing fill in sparse matrix factorizationProceedings of the Sixth SIAM Conference on Parallel Processing for Scientific Computing1993445452
- ChengCKWeiYCAAn improved two-way partitioning algorithm with stable performanceIEEE T Comput Aid D1991101502151110.1109/43.103500
- GarbersJPromelHJStegerAFinding clusters in VLSI circuitsProceedings of IEEE International Conference on Computer Aided Design1990520523
- HagenLKahngAA new approach to effective circuit clusteringProceedings of IEEE International Conference on Computer-Aided Design1992422427
- KarypisGKumarVAnalysis of multilevel graph partitioning1995
- BarnardSTSimonHDA fast multilevel implementation of recursive spectral bisection for partitioning unstructured problemsProceedings of the Sixth SIAM Conference on Parallel Processing for Scientific Computing1993711718
- HendricksonBLelandRAn improved spectral graph partitioning algorithm for mapping parallel computations1992
- PothenASimonHDWangLBernardSTTowards a fast implementation of spectral nested dissectionProceedings of Supercomputing 199219924251
- PothenASimonHDLiouKPPartitioning sparse matrices with eigenvectors of graphsSIAM J Matrix Anal A19901143045210.1137/0611030
- AlpertCJKahngABYaoSZSpectral partitioning with multiple eigenvectorsDiscrete Appl Math19999032610.1016/S0166-218X(98)00083-3
- MillerGLTengSHVavasisSAA unified geometric approach to graph separatorsProceedings of the 32nd Annual Symposium on Foundations of Computer Science1991538547
- MillerGLTengSHThurstonWVavasisSAAutomatic mesh partitioningSparse Matrix Computations: Graph Theory Issues and Algorithms19935784
- BarnesERAn algorithm for partitioning the nodes of a graphSIAM J Algeb Discr Meth1984354155010.1137/0603056
- GeorgeANested dissection of a regular finite-element meshSIAM J Numer Anal19731034536310.1137/0710032
- GoehringTSaadYHeuristic algorithms for automatic graph partitioning1994
- PatkarSBNarayananHImproving graph partitions using submodular functionsDiscrete Appl Math200313153555310.1016/S0166-218X(02)00472-9
- FiducciaCMMattheysesRMA linear time heuristic for improving network partitionsProceedings of the Nineteenth Design Automation Conference1982175181
- De JongKASpearsWMA formal analysis of the role of multi-point crossover in genetic algorithmsAnn Math Artif Intell1992512610.1007/BF01530777