✦ LIBER ✦

On the complexity of testing membership in the core of min-cost spanning tree games

✍ Scribed by Ulrich Faigle; Walter Kern; Sándor P. Fekete; Winfried Hochstättler

Publisher: Springer-Verlag
Year: 1997
Tongue: English
Weight: 291 KB
Volume: 26
Category: Article
ISSN: 0020-7276
DOI: 10.1007/bf01263277

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The irreducible Core of a minimum cost s

The irreducible Core of a minimum cost spanning tree game

✍ Harry Aarts; Theo Driessen 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 606 KB

Inapplicability of Asymptotic Results on

Inapplicability of Asymptotic Results on the Minimal Spanning Tree in Statistical Testing

✍ C. Caroni; P. Prescott 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 62 KB

Penrose has given asymptotic results for the distribution of the longest edge of the minimal spanning tree and nearest neighbour graph for sets of multivariate uniformly or normally distributed points. We investigate the applicability of these results to samples of up to 100 points, in up to 10 dime

Electronic, Molecular Weight, Molecular

Electronic, Molecular Weight, Molecular Volume, and Financial Cost-Scaling and Comparison of Two-Photon Absorption Efficiency in Disparate Molecules (Organometallic Complexes for Nonlinear Optics. 48.) – A Response to “Comment on ‘Organometallic Complexes for Nonlinear Optics. 45. Dispersion of the Third-Order Nonlinear Optical Properties of Triphenylamine-Cored Alkynylruthenium Dendrimers.’ Increasing the Nonlinear Response by Two Orders of Magnitude.”

✍ Torsten Schwich; Marie P. Cifuentes; Paul A. Gugger; Marek Samoc; Mark G. Humphr 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 277 KB 👁 2 views