Recent directions in netlist partitioning: a survey
From MaRDI portal
Publication:3122465
DOI10.1016/0167-9260(95)00008-4zbMath0876.94063OpenAlexW1984283136MaRDI QIDQ3122465
Charles J. Alpert, Andrew B. Kahng
Publication date: 27 February 1997
Published in: Integration (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-9260(95)00008-4
surveygeometric representationsclustering approachescombinatorial formulationsmove-based approachesnetlist partitioning
Related Items (46)
Extended cuts ⋮ Comparison of algorithms in graph partitioning ⋮ Experimental evaluation of a local search approximation algorithm for the multiway cut problem ⋮ Network bipartitioning in the anti-communicability Euclidean space ⋮ Evaluating the Kernighan-Lin Heuristic for Hardware/Software Partitioning ⋮ A branch-and-bound algorithm for the acyclic partitioning problem ⋮ An exact algorithm for min-max hyperstructure equipartition with a connected constraint ⋮ Solving Graph Partitioning Problems Arising in Tagless Cache Management ⋮ Spectral partitioning works: planar graphs and finite element meshes ⋮ Metaheuristics: A bibliography ⋮ On partitioning of hypergraphs ⋮ Semidefinite approximations for quadratic programs over orthogonal matrices ⋮ Hypergraph Cuts with General Splitting Functions ⋮ ILP-Based Local Search for Graph Partitioning ⋮ An effective multilevel tabu search approach for balanced graph partitioning ⋮ Empirical study on sufficient numbers of minimum cuts in strongly connected directed random graphs ⋮ A reductive approach to hypergraph clustering: an application to image segmentation ⋮ Iterative denoising ⋮ A local search approximation algorithm for the multiway cut problem ⋮ Constrained Min-Cut Replication for K-Way Hypergraph Partitioning ⋮ Parallel multilevel algorithms for hypergraph partitioning ⋮ Multi-level direct \(K\)-way hypergraph partitioning with multiple constraints and fixed vertices ⋮ Linear and quadratic programming approaches for the general graph partitioning problem ⋮ Hypergraph \(k\)-cut in randomized polynomial time ⋮ A note on edge-based graph partitioning and its linear algebraic structure ⋮ A semidefinite programming approach to the hypergraph minimum bisection problem ⋮ Reformulated acyclic partitioning for rail-rail containers transshipment ⋮ The Effect of Various Sparsity Structures on Parallelism and Algorithms to Reveal Those Structures ⋮ An object-oriented design for graph visualization ⋮ A global method for the limited K‐partitioning of hypergraphs representing optimal design problems in complex machine systems ⋮ Contribution of copositive formulations to the graph partitioning problem ⋮ The complexity of detecting fixed-density clusters ⋮ Hypergraph with sampling for image retrieval ⋮ Adapting Iterative-Improvement Heuristics for Scheduling File-Sharing Tasks on Heterogeneous Platforms ⋮ Mathematical methods for physical layout of printed circuit boards: an overview ⋮ Relaxation-Based Coarsening for Multilevel Hypergraph Partitioning ⋮ Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning ⋮ Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm ⋮ Geometric quadrisection in linear time, with application to VLSI placement ⋮ Spectral partitioning with multiple eigenvectors ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Nature's way of optimizing ⋮ NP-hard and linear variants of hypergraph partitioning ⋮ Comparing recent methods in graph partitioning ⋮ Network Flow-Based Refinement for Multilevel Hypergraph Partitioning
This page was built for publication: Recent directions in netlist partitioning: a survey
