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

On randomized greedy matchings

โœ Scribed by Zevi Miller; Dan Pritikin

Publisher
John Wiley and Sons
Year
1997
Tongue
English
Weight
312 KB
Volume
10
Category
Article
ISSN
1042-9832

No coin nor oath required. For personal study only.

โœฆ Synopsis

where the class โŒฌ-GRAPHS is the set of graphs of maximum degree at most โŒฌ . แฎŠ 1997 John

ลฝ

.

๐Ÿ“œ SIMILAR VOLUMES

An Almost-Greedy Search on Random Binary
An Almost-Greedy Search on Random Binary Vectors and Random Graphs
โœ Avner Dor; Eitan Greenshtein ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 193 KB

A random vector is sampled from a general binary probability space and a search goes through the coordinates until a 1-coordinate is found. A search algorithm called ''almost greedy'' is shown to posses some novel characteristics. Its expectation is shown to be sharply bounded by four times the expe

Asymptotic packing and the random greedy
Asymptotic packing and the random greedy algorithm
โœ Vojtฤ›ch Rรถdl; Luboลก Thoma ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 593 KB

Let H be an r-uniform hypergraph satisfying deg(x) = D(l + o( 1)) for each vertex x E V ( H ) and deg(x, y) = o ( D ) for each pair of vertices x, y E V ( H ) , where D+=. Recently, J . Spencer [5] showed, using a branching process approach, that almost surely the random greedy algorithm finds a pac

On induced matchings
On induced matchings
โœ Angelika Steger; Min-li Yu ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 313 KB

Let q\*(G) denote the minimum integer t for which E(G) can be partitioned into t induced matchings of G. Faudree et al. conjectured that q\*(G)<d2, if G is a bipartite graph and d is the maximum degree of G. In this note, we give an affirmative answer for d=3, the first nontrivial case of this conje