𝔖 Bobbio Scriptorium

✦ LIBER ✦

A Simple Proof of the $O( \sqrt{n} \log^{3 / 4} n )$ Upright Matching Bound

✍ Scribed by Coffman, Jr., E. G.; Shor, P. W.

Book ID: 118197515
Publisher: Society for Industrial and Applied Mathematics
Year: 1991
Tongue: English
Weight: 889 KB
Volume: 4
Category: Article
ISSN: 0895-4801
DOI: 10.1137/0404005

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Balanced network flows. VIII. A revised

Balanced network flows. VIII. A revised theory of phase-ordered algorithms and the O( log(n2/m)/log n) bound for the nonbipartite cardinality matching problem

✍ Christian Fremuth-Paeger; Dieter Jungnickel 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 108 KB 👁 1 views

The archetype for a new class of simple

The archetype for a new class of simple extended 3D honeycomb frameworks. The synthesis and x-ray crystal structures of Cd(CN)5/3(OH)1/3.1/3(C6H12N4), Cd(CN)2.1/3(C6H12N4), and Cd(Cn)2.2/3H2O.tBuOH (C6H12N4 = hexamethylenetetramine) revealing two topologically equivalent but geometrically different frameworks

✍ Abrahams, Brendan F.; Hoskins, Bernard F.; Liu, Jianping; Robson, Richard 📂 Article 📅 1991 🏛 American Chemical Society 🌐 English ⚖ 914 KB