Embedding the incomplete hypercube in books (Q1044693): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2005.05.026
+Normal rank
@@ Property / OpenAlex ID @@
+W2046331281
@@ Property / OpenAlex ID: W2046331281 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3484355
@@ Property / cites work: Q3484355 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimum embedding of complete graphs in books
@@ Property / cites work: Optimum embedding of complete graphs in books / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient generation of the binary reflected gray code and its applications
+Normal rank
@@ Property / cites work @@
+Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
+Normal rank
@@ Property / cites work @@
+Embedding cycles and meshes onto incomplete hypercubes
+Normal rank
@@ Property / cites work @@
+Parallel routing algorithms for incomplete hypercube interconnection networks
+Normal rank
@@ Property / cites work @@
+An effective routing algorithm in incomplete hypercubes
+Normal rank
@@ Property / cites work @@
+Q4002466
@@ Property / cites work: Q4002466 / rank @@
+Normal rank
@@ Property / cites work @@
+Embedding planar graphs in four pages
@@ Property / cites work: Embedding planar graphs in four pages / rank @@
+Normal rank