✦ LIBER ✦

Reconstruction of hidden graphs and threshold group testing

✍ Scribed by Huilan Chang; Hong-Bin Chen; Hung-Lin Fu; Chie-Huai Shi

Publisher: Springer US
Year: 2010
Tongue: English
Weight: 502 KB
Volume: 22
Category: Article
ISSN: 1382-6905
DOI: 10.1007/s10878-010-9291-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Reconstruction graphs and testing their

Reconstruction graphs and testing their properties in a relational spatial database

✍ Á.B. Novák; Zs. Tuza 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 867 KB

Among other representations, the relational databases are also widely used for storing spatial data. The model presented in this paper is a slightly modified version of the PLA database [1]. This spatial relational model serves to represent the topological properties of geographic data. In this pap

A class of threshold and domishold graph

A class of threshold and domishold graphs: equistable and equidominating graphs

✍ Charles Payan 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 484 KB

A thwahold grerph (rtzspativ4y domlshukf graph) is 01 graph for which the independent 881% (rapsctiwzly ths dominuting a&a) cctn bgr chnfuctsrixsd by the 0, l-aolutiona of a linaur ## kpallty (ass [ij and [S]), We define here the #rugher far which the mawlmal indapsndent eettr (rsopsctivsly tha m

Comparison of perception threshold testi

Comparison of perception threshold testing and thermal-vibratory testing

✍ Lior Lowenstein; Kathy Jesse; Kimberly Kenton 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 101 KB

Computer reconstruction of small graphs

✍ B. D. McKay 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 114 KB

## Abstract The Reconstruction Conjecture is established for graphs with nine vertices.

Class-reconstruction of total graphs

✍ David W. Bange; Anthony E. Barkauskas; Linda H. Host 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 533 KB

It is shown that given any vertex-deleted total graph, every reconstruction into a total graph by the addition of a vertex yields the original total graph. The proof indicates how the reconstruction can be done. Hu, for i = 1 , . . . , p , then G Definition. Let C be a class of graphs. A graph G E C

Some properties of 2-threshold graphs

✍ P. L. Hammer; N. V. R. Mahadev; U. N. Peled 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 330 KB