Linear arrangement problems on recursively partitioned graphs (Q3778551): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+An Efficient Heuristic Procedure for Partitioning Graphs
+Normal rank
@@ Property / cites work @@
+The NP-completeness of the bandwidth minimization problem
+Normal rank
@@ Property / cites work @@
+Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial Time
+Normal rank
@@ Property / cites work @@
+A Minimum Linear Arrangement Algorithm for Undirected Trees
+Normal rank
@@ Property / cites work @@
+A polynomial algorithm for the min-cut linear arrangement of trees
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf01928924
+Normal rank
@@ Property / OpenAlex ID @@
+W1979073798
@@ Property / OpenAlex ID: W1979073798 / rank @@
+Normal rank