✦ LIBER ✦

An Upper Bound for the Bisection Width of a Diagonal Mesh

✍ Scribed by Tang, K.W.; Kamoua, R.

Book ID: 118697994
Publisher: IEEE
Year: 2007
Tongue: English
Weight: 793 KB
Volume: 56
Category: Article
ISSN: 0018-9340
DOI: 10.1109/tc.2007.40

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A counterexample to Tang and Padubidri's

A counterexample to Tang and Padubidri's claim about the bisection width of a diagonal mesh

✍ Jha, P.K. 📂 Article 📅 2003 🏛 IEEE 🌐 English ⚖ 226 KB

An upper bound for of strictly diagonall

An upper bound for of strictly diagonally dominant M-matrices

✍ Guang-Hui Cheng; Ting-Zhu Huang 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 130 KB

An upper bound for of strictly diagonall

An upper bound for of strictly diagonally dominant M-matrices

✍ Ping Wang 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 124 KB

Let A be a real strictly diagonally dominant M-matrix. We give a sharp upper bound for A -1 ∞ . Furthermore, the lower bound of the smallest eigenvalue q(A)

An Upper Bound of the Throughput for Mul

An Upper Bound of the Throughput for Multi-Radio Wireless Mesh Networks

✍ Rong-Hong Jan; Shu-Ying Huang; Chu-Fu Wang 📂 Article 📅 2010 🏛 IEEE 🌐 English ⚖ 434 KB

An Upper Bound for the Probability of a

An Upper Bound for the Probability of a Union

✍ David Hunter 📂 Article 📅 1976 🏛 Applied Probability Trust 🌐 English ⚖ 569 KB

An upper bound for the diameter of a pol

An upper bound for the diameter of a polytope

✍ David Barnette 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 515 KB

The distance between two vertices of a polytope is the minimum number of edges in a path joining them. The diameter of a polytope is the greatest distance between two vertices of the polytope. We show that if P is a d-dimensional polytope with n facets, then the diameter of P is at most $ $-3(,r -d