Minimal Steiner trees for \(2^ k \times 2^ k\) square lattices (Q1906121): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/jcta.1996.0004 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1984325977 / rank | |||
Normal rank | |||
Latest revision as of 19:34, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimal Steiner trees for \(2^ k \times 2^ k\) square lattices |
scientific article |
Statements
Minimal Steiner trees for \(2^ k \times 2^ k\) square lattices (English)
0 references
13 May 1996
0 references
The authors prove a conjecture of Chung, Graham, and Gardner, giving the form of the minimal Steiner trees for the set of points comprising the vertices of a \(2^k\times 2^k\) square lattice. The basic building block of these trees is the minimal Steiner tree of the vertices of a (unit) square.
0 references
minimal Steiner trees
0 references
square lattice
0 references
