Local search for constrained graph clustering in biological networks
From MaRDI portal
Publication:2668745
DOI10.1016/j.cor.2021.105299OpenAlexW3156421656MaRDI QIDQ2668745
Dries Van Daele, Behrouz Babaki, Pieter Leyman, Duy Hoang Tran, Patrick de Causmaecker
Publication date: 7 March 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://lirias.kuleuven.be/handle/123456789/674255
iterated local searchKernighan-Lin algorithmmultilevel clusteringAMG-based coarseningconstrained graph clustering
Related Items (2)
Neighborhood decomposition-driven variable neighborhood search for capacitated clustering ⋮ An exact algorithm for semi-supervised minimum sum-of-squares clustering
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- An effective multilevel tabu search approach for balanced graph partitioning
- An efficient memetic algorithm for the graph partitioning problem
- A simple approximation algorithm for the weighted matching problem
- Semi-supervised graph clustering: a kernel approach
- Shape-optimized mesh partitioning and load balancing for parallel adaptive FEM
- Tabu search for graph partitioning
- A reactive self-tuning scheme for multilevel graph partitioning
- A global optimization RLT-based approach for solving the hard clustering problem
- Advanced Coarsening Schemes for Graph Partitioning
- Relaxation-Based Coarsening and Multiscale Graph Organization
- Algebraic Distance on Graphs
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- An Efficient Heuristic Procedure for Partitioning Graphs
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- Imposing Connectivity Constraints in Forest Planning Models
- Engineering Algorithms for Approximate Weighted Matching
This page was built for publication: Local search for constrained graph clustering in biological networks