Two models of two-dimensional bandwidth problems (Q656608): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2010.04.013
+Normal rank
@@ Property / OpenAlex ID @@
+W1968798293
@@ Property / OpenAlex ID: W1968798293 / rank @@
+Normal rank
@@ Property / cites work @@
+A framework for solving VLSI graph layout problems
+Normal rank
@@ Property / cites work @@
+The complexity of minimizing wire lengths in VLSI layouts
+Normal rank
@@ Property / cites work @@
+The bandwidth problem for graphs and matrices—a survey
+Normal rank
@@ Property / cites work @@
+Q3803160
@@ Property / cites work: Q3803160 / rank @@
+Normal rank
@@ Property / cites work @@
+A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
+Normal rank
@@ Property / cites work @@
+Q4391526
@@ Property / cites work: Q4391526 / rank @@
+Normal rank
@@ Property / cites work @@
+Embeddings of complete binary trees into grids and extended grids with total vertex-congestion 1
+Normal rank
@@ Property / cites work @@
+The Bandwidth Problem: critical Subgraphs and the Solution for Caterpillars
+Normal rank
@@ Property / cites work @@
+VLSI layouts of complete graphs and star graphs
@@ Property / cites work: VLSI layouts of complete graphs and star graphs / rank @@
+Normal rank