Upper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on Trees (Q3951561): Difference between revisions

@@ 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.1137/0603010
@@ Property / full work available at URL: https://doi.org/10.1137/0603010 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1970580433
@@ Property / OpenAlex ID: W1970580433 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Assignments of Numbers to Vertices
@@ Property / cites work: Optimal Assignments of Numbers to Vertices / rank @@
+Normal rank
@@ Property / cites work @@
+The space complexity of pebble games on trees
@@ Property / cites work: The space complexity of pebble games on trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q3048639
@@ Property / cites work: Q3048639 / rank @@
+Normal rank
@@ Property / cites work @@
+A Minimum Linear Arrangement Algorithm for Undirected Trees
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3951561