✦ LIBER ✦

A binary search problem on graphs

✍ Scribed by Reinhard Franzkeit

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 315 KB
Volume: 36
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(92)90207-q

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A ternary search problem on graphs

✍ Thomas Andreae 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 674 KB

Search problems on graphs

✍ M. Aigner 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 609 KB

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

Solution of Ulam's problem on binary sea

Solution of Ulam's problem on binary search with two lies

✍ Jurek Czyzowicz; Andrzej Pelc; Daniele Mundici 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 266 KB

Solution of Ulam's problem on binary sea

Solution of Ulam's problem on binary search with three lies

✍ Alberto Negro; Matteo Sereno 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 263 KB

A search problem on graphs which general

A search problem on graphs which generalizes some group testing problems with two defectives

✍ Thomas Andreae 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 499 KB

A search problem on graphs which generalizes some group testing problems with two defectives, Discrete Mathematics 88 (1991) 121-127. We consider a search problem which generalizes the group testing problems previously studied in papers of Chang/Hwang and Chang/Hwang/Lin. In its general form for a