The complexity of finding uniform emulations on paths and ring networks (Q918210): Difference between revisions

@@ Property / cites work @@
+Q3769937
@@ Property / cites work: Q3769937 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of finding uniform emulations on fixed graphs
+Normal rank
@@ Property / cites work @@
+Simulation of large networks on smaller networks
@@ Property / cites work: Simulation of large networks on smaller networks / rank @@
+Normal rank
@@ Property / cites work @@
+Quotient Networks
@@ Property / cites work: Quotient Networks / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity Results for Bandwidth Minimization
@@ Property / cites work: Complexity Results for Bandwidth Minimization / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem
+Normal rank
@@ Property / cites work @@
+On Some Variants of the Bandwidth Minimization Problem
+Normal rank
@@ Property / cites work @@
+Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial Time
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0890-5401(90)90027-f
+Normal rank
@@ Property / OpenAlex ID @@
+W1978600315
@@ Property / OpenAlex ID: W1978600315 / rank @@
+Normal rank