Publication:3914447
From MaRDI portal
zbMath0463.68058MaRDI QIDQ3914447
Publication date: 1981
worst-case cost; pebble games; computation-motivated study; efficient embeddings; generic families of graphs; representative examples; similarity of families of graphs; tradeoffs among costs
68R10: Graph theory (including graph drawing) in computer science
Related Items
Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength, Embeddings of binary trees in lines, Fixed hypercube embedding, Recursive circulants and their embeddings among hypercubes, An optimal layout of multigrid networks, Directed virtual path layouts in ATM networks, A linear time algorithm for embedding hypercube into cylinder and torus