๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Upper and lower bounds for stochastic marked graphs

โœ Scribed by Sergio Rajsbaum

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
457 KB
Volume
49
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Lower bounds and upper bounds for chroma
Lower bounds and upper bounds for chromatic polynomials
โœ Klaus Dohmen ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 204 KB

## Abstract In this paper we give lower bounds and upper bounds for chromatic polynomials of simple undirected graphs on __n__ vertices having __m__ edges and girth exceeding __g__ ยฉ 1993 John Wiley & Sons, Inc.

Average Costs of a Graph Exploration: Up
Average Costs of a Graph Exploration: Upper and Lower Bounds
โœ Nicola Galli ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 168 KB

We consider the exploration of random digraphs. We give upper and lower bounds for the expected number of edges traversed during an exploration. This result implies a lower bound for the expected running time of a wide class of algorithms, e.g., breadth-first-search, depth-first-search, and algorith

Improved upper and lower bounds for k-br
Improved upper and lower bounds for k-broadcasting
โœ Hovhannes A. Harutyunyan; Arthur L. Liestman ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 150 KB ๐Ÿ‘ 2 views
Upper and lower bounds for local electro
Upper and lower bounds for local electromagnetic quantities
โœ R. Albanese; R. Fresa ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 155 KB ๐Ÿ‘ 1 views

Most engineering problems are solved by means of numerical methods that are able to provide only approximate solutions, for which it would be extremely useful to have efficient error estimators. Upper and lower bounds for quantities of integral character, like the stored magnetic energy or the ohmi