We give a technique for obtaining a lower bound on the bandwidth of any planar graph with an embedding in which all bounded faces are triangles. This technique is applied to show that, for each positive integer 1, the triangulated triangle T~ with side-length 1 has bandwidth exactly I + 1. This sett
β¦ LIBER β¦
On the bandwidth of convex triangulation meshes
β Scribed by Peter C.B. Lam; W.C. Shiu; W.H. Chan; Y. Lin
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 198 KB
- Volume
- 173
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
On the bandwidth of triangulated triangl
β
Robert Hochberg; Colin McDiarmid; Michael Saks
π
Article
π
1995
π
Elsevier Science
π
English
β 210 KB
On convexity of piecewise polynomial fun
β
Thomas A. Grandine
π
Article
π
1989
π
Elsevier Science
π
English
β 464 KB
Convexity of BΓ©zier nets on triangulatio
β
T.N.T. Goodman
π
Article
π
1991
π
Elsevier Science
π
English
β 330 KB
P-Bandwidth Priority Queues on Reconfigu
β
Alan A. Bertossi; Alessandro Mei
π
Article
π
1997
π
Elsevier Science
π
English
β 356 KB
This paper shows a parallel implementation of a priority queue with bandwidth P and maximum size nP by means of a network with reconfigurable buses. The proposed solution is based on a tree of meshes architecture of O(nP 2 ) processors and O(P log n) maximum subbus length. The computational times re
Improvements of the program βa versatile
β
Lars-Erik Lindgren
π
Article
π
1987
π
Elsevier Science
π
English
β 153 KB
On the bandwidth of asynchronous multipr
β
G.M. Chaudhry
π
Article
π
1992
π
Elsevier Science
β 422 KB