On the bandwidth of convex triangulation meshes (Q1367046): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3097395 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The bandwidth problem for graphs and matrices—a survey / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3803160 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal labelling of a product of two paths / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal numberings and isoperimetric problems on graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the bandwidth of triangulated triangles / rank | |||
Normal rank | |||
Revision as of 18:55, 27 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the bandwidth of convex triangulation meshes |
scientific article |
Statements
On the bandwidth of convex triangulation meshes (English)
0 references
17 September 1997
0 references
bandwidth of triangulated triangles
0 references
convex triangulation meshes
0 references
