JOURNAL ARTICLE
The dynamic locking heuristic-a new graph partitioning algorithm
Abstract
In layout design finding efficiently good solutions to the hypergraph bipartitioning problem is of great importance. This paper introduces a new algorithm, the dynamic locking algorithm, which has empirically shown a significant improvement in the partitioning result compared to known algorithms.< >
Keywords:
Computer science Heuristic Hypergraph Algorithm Graph partition Graph Algorithm design Dynamic programming Theoretical computer science Parallel computing Artificial intelligence Mathematics Combinatorics
Metrics
17
Cited By
0.94
FWCI (Field Weighted Citation Impact)
8
Refs
0.74
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Citation History
Topics
VLSI and FPGA Design Techniques
Physical Sciences → Engineering → Electrical and Electronic Engineering
Embedded Systems Design Techniques
Physical Sciences → Computer Science → Hardware and Architecture
Interconnection Networks and Systems
Physical Sciences → Computer Science → Computer Networks and Communications
Related Documents
BOOK-CHAPTER
Multilevel Heuristic Algorithm for Graph Partitioning
Raúl BañosC. GilJulio OrtegaFrancisco G. Montoya
Lecture notes in computer science Year: 2003 Pages: 143-153
JOURNAL ARTICLE
DyBGP: A Dynamic-Balanced Algorithm for Graph Partitioning Based on Heuristic Strategies
Year: 2017 Vol: 54 (12)
JOURNAL ARTICLE
Graph isomorphism: A heuristic edge-partitioning-oriented algorithm
Journal: Computing Year: 1974 Vol: 12 (4)Pages: 291-313
JOURNAL ARTICLE
A Two-Phase Heuristic Algorithm for Effective Graph Partitioning
Anirudha GhoshAnil TuduAnkita MardanaDebaditya Barman
Year: 2024 Pages: 1-6
BOOK-CHAPTER
Graph Partitioning Using Heuristic Kernighan-Lin Algorithm for Parallel Computing
Siddheshwar V. PatilD.B. Kulkarni
Advances in intelligent systems and computing Year: 2020 Pages: 281-288