Efficient algorithm for graph-partitioning problem using a problem transformation method (Q583241): Difference between revisions

@@ Property / author @@
+Sumit K. Garg
@@ Property / author: Sumit K. Garg / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C70
@@ Property / Mathematics Subject Classification ID: 05C70 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+4132209
@@ Property / zbMATH DE Number: 4132209 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+electronic design automation
@@ Property / zbMATH Keywords: electronic design automation / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+circuit partitioning
@@ Property / zbMATH Keywords: circuit partitioning / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+k-way graph- partitioning problem
@@ Property / zbMATH Keywords: k-way graph- partitioning problem / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+Kernighan-Lin algorithm
@@ Property / zbMATH Keywords: Kernighan-Lin algorithm / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+maximum cutset
@@ Property / zbMATH Keywords: maximum cutset / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+uniform k- way partitioning problem
@@ Property / zbMATH Keywords: uniform k- way partitioning problem / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+max-cut problem
@@ Property / zbMATH Keywords: max-cut problem / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0010-4485(89)90159-0
+Normal rank
@@ Property / OpenAlex ID @@
+W1964201692
@@ Property / OpenAlex ID: W1964201692 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:583241