✦ LIBER ✦

A Tight Upper Bound on the Benefits of Replica Control Protocols

✍ Scribed by D.B. Johnson; L. Raab

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 737 KB
Volume: 51
Category: Article
ISSN: 0022-0000
DOI: 10.1006/jcss.1995.1059

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A tight upper bound of the lumped disk s

A tight upper bound of the lumped disk seek time for the Scan disk scheduling policy

✍ Yen-Jen Oyang 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 273 KB

Tight bounds on the chromatic sum of a c

Tight bounds on the chromatic sum of a connected graph

✍ Carsten Thomassen; Paul Erdös; Yousef Alavi; Paresh J. Malde; Allen J. Schwenk 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 236 KB 👁 1 views

A tight lower bound on the maximum genus

A tight lower bound on the maximum genus of a simplicial graph

✍ Jianer Chen; Saroja P. Kanchi; Jonathan L. Gross 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 856 KB

It is proved that every connected simplicial graph with minimum valence at least three has maximum genus at least one-quarter of its cycle rank. This follows from the technical result that every 3-regular simplicial graph except K4 has a Xuong co-tree whose odd components have only one edge each. It

The Order Upper Bound on Parity Embeddin

The Order Upper Bound on Parity Embedding of a Graph

✍ Thomas Zaslavsky 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 398 KB

A graph 1 is parity embedded in a surface if a closed path in the graph is orientation preserving or reversing according to whether its length is even or odd. The parity demigenus of 1 is the minimum of 2&/(S) (where / is the Euler characteristic) over all surfaces S in which 1 can be parity embedde

A New Upper Bound on the Cheeger Number

A New Upper Bound on the Cheeger Number of a Graph

✍ Sorin Dragomir; Elisabetta Barletta 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 117 KB

Using a technique developed by A. Nilli (1991, Discrete Math. 91, 207 210), we estimate from above the Cheeger number of a finite connected graph G of small degree (2(G) 5) admitting sufficiently distant edges. ## 2001 Academic Press Let G=(V(G), E(G)) be a finite connected graph. The Cheeger numb

A 222pn upper bound on the complexity of

A 222pn upper bound on the complexity of Presburger Arithmetic

✍ Derek C. Oppen 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 605 KB