Lattice bandwidth of random graphs (Q810061): Difference between revisions

The lattice bandwidth B(G) of a graph is defined as the minimum diameter of any graph isomorphic to G embedded on a multidimensional integer lattice. Probabilistic properties of B(G) are given for Bernoulli graphs G.

0 references

Mathematics Subject Classification ID

05C78

0 references

0 references

0 references

0 references

graph labelling

0 references

random graphs

0 references

lattice bandwidth

0 references

Bernoulli graphs

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

The complexity of minimizing wire lengths in VLSI layouts

0 references

Q3682518

0 references

The chromatic number of random graphs

0 references

Q4733889

0 references

Complexity Results for Bandwidth Minimization

0 references

Q3744198

0 references

A framework for solving VLSI graph layout problems

0 references

Achromatic numbers of random graphs

0 references

NP-completeness for minimizing maximum edge length in grid embeddings

0 references

Q3798266

0 references

Q3680834

0 references

Bounds on the costs of data encodings

0 references

On the Probable Performance of Heuristics for Bandwidth Minimization

0 references

On the Bandwidth of Random Graphs

0 references

full work available at URL

https://doi.org/10.1016/0166-218x(91)90046-y

0 references

OpenAlex ID

W2131972252

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:810061

@@ Property / author @@
-Colin J. H. McDiarmid
@@ Property / author: Colin J. H. McDiarmid / rank @@
-Normal rank
@@ Property / author @@
+Colin J. H. McDiarmid
@@ Property / author: Colin J. H. McDiarmid / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of minimizing wire lengths in VLSI layouts
+Normal rank
@@ Property / cites work @@
+Q3682518
@@ Property / cites work: Q3682518 / rank @@
+Normal rank
@@ Property / cites work @@
+The chromatic number of random graphs
@@ Property / cites work: The chromatic number of random graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4733889
@@ Property / cites work: Q4733889 / 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 @@
+Q3744198
@@ Property / cites work: Q3744198 / rank @@
+Normal rank
@@ Property / cites work @@
+A framework for solving VLSI graph layout problems
+Normal rank
@@ Property / cites work @@
+Achromatic numbers of random graphs
@@ Property / cites work: Achromatic numbers of random graphs / rank @@
+Normal rank
@@ Property / cites work @@
+NP-completeness for minimizing maximum edge length in grid embeddings
+Normal rank
@@ Property / cites work @@
+Q3798266
@@ Property / cites work: Q3798266 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3680834
@@ Property / cites work: Q3680834 / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds on the costs of data encodings
@@ Property / cites work: Bounds on the costs of data encodings / rank @@
+Normal rank
@@ Property / cites work @@
+On the Probable Performance of Heuristics for Bandwidth Minimization
+Normal rank
@@ Property / cites work @@
+On the Bandwidth of Random Graphs
@@ Property / cites work: On the Bandwidth of Random Graphs / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0166-218x(91)90046-y
+Normal rank
@@ Property / OpenAlex ID @@
+W2131972252
@@ Property / OpenAlex ID: W2131972252 / rank @@
+Normal rank