Pages that link to "Item:Q3122465"
From MaRDI portal
The following pages link to Recent directions in netlist partitioning: a survey (Q3122465):
Displayed 46 items.
- Extended cuts (Q266025) (← links)
- A branch-and-bound algorithm for the acyclic partitioning problem (Q336782) (← links)
- A reductive approach to hypergraph clustering: an application to image segmentation (Q411948) (← links)
- Parallel multilevel algorithms for hypergraph partitioning (Q436760) (← links)
- Multi-level direct \(K\)-way hypergraph partitioning with multiple constraints and fixed vertices (Q436766) (← links)
- Semidefinite approximations for quadratic programs over orthogonal matrices (Q609564) (← links)
- An effective multilevel tabu search approach for balanced graph partitioning (Q622162) (← links)
- Iterative denoising (Q626230) (← links)
- A note on edge-based graph partitioning and its linear algebraic structure (Q662140) (← links)
- Experimental evaluation of a local search approximation algorithm for the multiway cut problem (Q831743) (← links)
- Spectral partitioning works: planar graphs and finite element meshes (Q869898) (← links)
- On partitioning of hypergraphs (Q879389) (← links)
- Mathematical methods for physical layout of printed circuit boards: an overview (Q991814) (← links)
- Geometric quadrisection in linear time, with application to VLSI placement (Q1019299) (← links)
- NP-hard and linear variants of hypergraph partitioning (Q1041217) (← links)
- Spectral partitioning with multiple eigenvectors (Q1276952) (← links)
- Nature's way of optimizing (Q1575193) (← links)
- An exact algorithm for min-max hyperstructure equipartition with a connected constraint (Q1652415) (← links)
- Reformulated acyclic partitioning for rail-rail containers transshipment (Q1735174) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- Linear and quadratic programming approaches for the general graph partitioning problem (Q1959249) (← links)
- Network bipartitioning in the anti-communicability Euclidean space (Q2131522) (← links)
- Hypergraph \(k\)-cut in randomized polynomial time (Q2227530) (← links)
- Hypergraph with sampling for image retrieval (Q2275975) (← links)
- The complexity of detecting fixed-density clusters (Q2499577) (← links)
- Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning (Q2515049) (← links)
- An object-oriented design for graph visualization (Q2745262) (← links)
- Constrained Min-Cut Replication for <i>K</i>-Way Hypergraph Partitioning (Q2962559) (← links)
- A semidefinite programming approach to the hypergraph minimum bisection problem (Q2996813) (← links)
- A global method for the limited K‐partitioning of hypergraphs representing optimal design problems in complex machine systems (Q3018714) (← links)
- Comparison of algorithms in graph partitioning (Q3163669) (← links)
- Solving Graph Partitioning Problems Arising in Tagless Cache Management (Q3195315) (← links)
- The Effect of Various Sparsity Structures on Parallelism and Algorithms to Reveal Those Structures (Q3300489) (← links)
- Comparing recent methods in graph partitioning (Q3439313) (← links)
- Adapting Iterative-Improvement Heuristics for Scheduling File-Sharing Tasks on Heterogeneous Platforms (Q3603112) (← links)
- Contribution of copositive formulations to the graph partitioning problem (Q4916308) (← links)
- Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm (Q5075796) (← links)
- Hypergraph Cuts with General Splitting Functions (Q5094916) (← links)
- Network Flow-Based Refinement for Multilevel Hypergraph Partitioning (Q5140705) (← links)
- (Q5140706) (← links)
- (Q5140710) (← links)
- Relaxation-Based Coarsening for Multilevel Hypergraph Partitioning (Q5197618) (← links)
- Evaluating the Kernighan-Lin Heuristic for Hardware/Software Partitioning (Q5308326) (← links)
- ILP-Based Local Search for Graph Partitioning (Q6039924) (← links)
- Empirical study on sufficient numbers of minimum cuts in strongly connected directed random graphs (Q6092652) (← links)
- A local search approximation algorithm for the multiway cut problem (Q6166037) (← links)