✦ LIBER ✦

Bounds on the size and transmission rate of communications protocols

✍ Scribed by A.V. Aho; A.D. Wyner; M. Yannakakis; J.D. Ullman

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 751 KB
Volume: 8
Category: Article
ISSN: 0898-1221
DOI: 10.1016/0898-1221(82)90043-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Upper Bounds on the Size of Obstructions

Upper Bounds on the Size of Obstructions and Intertwines

✍ Jens Lagergren 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 417 KB

We give an exponential upper bound in p 4 on the size of any obstruction for path-width at most p. We give a doubly exponential upper bound in k 5 on the size of any obstruction for tree-width at most k. We also give an upper bound on the size of any intertwine of two given trees T and T $. The boun

Communications on the theory of diffusio

Communications on the theory of diffusion and reaction—VIII Variational bounds on the effectiveness factor

✍ S. Rester; R. Aris 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 932 KB

It is shown how upper and lower bounds to the effectiveness factor may be obtained by variational methods. The formulae are developed to be capable of handling mass transferresistance at the surface of the catalyst particle, a diffusion coefficient which depends upon position in the particle, and a

Bounds on the size of branch-and-bound p

Bounds on the size of branch-and-bound proofs for integer knapsacks

✍ Bala Krishnamoorthy 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 172 KB

Using a direct counting argument, we derive lower and upper bounds for the number of nodes enumerated by linear programming-based branch-and-bound (B&B) method to prove the integer infeasibility of a knapsack. We prove by example that the size of the B&B tree could be exponential in the worst case.

Forbidden subgraphs and bounds on the si

Forbidden subgraphs and bounds on the size of a maximum matching

✍ Michael D. Plummer; Akira Saito 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 126 KB 👁 1 views

## Abstract Let __K__~1,__n__~ denote the star on __n__ + 1 vertices; that is, __K__~1,__n__~ is the complete bipartite graph having one vertex in the first vertex class of its bipartition and __n__ in the second. The special graph __K__~1,3~, called the __claw__, has received much attention in the

Sharp bounds on the order, size, and sta

Sharp bounds on the order, size, and stability number of graphs

✍ Pierre Hansen; Maolin Zheng 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 276 KB

## Abstract We consider graphs __G = (V,E)__ with order ρ = |__V__|, size __e__ = |__E__|, and stability number β~0~. We collect or determine upper and lower bounds on each of these parameters expressed as functions of the two others. We prove that all these bounds are sharp. © __1993 by John Wiley

The finite model property and recursive

The finite model property and recursive bounds on the size of countermodels

✍ Dolph Ulrich 📂 Article 📅 1983 🏛 Springer Netherlands 🌐 English ⚖ 173 KB