Navigating in a Graph by Aid of Its Spanning Tree Metric (Q5894322): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/090761549 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1994320209 / rank | |||
Normal rank | |||
Latest revision as of 20:31, 19 March 2024
scientific article; zbMATH DE number 5964595
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Navigating in a Graph by Aid of Its Spanning Tree Metric |
scientific article; zbMATH DE number 5964595 |
Statements
Navigating in a Graph by Aid of Its Spanning Tree Metric (English)
0 references
27 October 2011
0 references
navigating in graphs
0 references
spanning trees
0 references
distances
0 references
routing in graphs
0 references
hypercubes
0 references
rectilinear grids
0 references
chordal graphs
0 references
chordal bipartite graphs
0 references
dually chordal graphs
0 references
\(k\)-trees
0 references
efficient algorithms
0 references
