A group testing problem for hypergraphs of bounded rank

被引：15
|
作者：
Triesch, E
机构：
[1] Forsch. Inst. fur Diskrete Math., D-53113 Bonn
来源：
DISCRETE APPLIED MATHEMATICS | 1996年 / 66卷 / 02期
关键词：
group testing; search problems; hypergraphs; Kraft's inequality;
D O I：
10.1016/0166-218X(95)00120-G
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Suppose that a hypergraph H = (V,E) of rank r is given as well as a probability distribution p(e) (e is an element of E) on the edges. We show that in the usual group testing model the unknown edge can be found by less than - log p(e) + r tests. For the case of the uniform distribution, the result proves a conjecture of Du and Hwang.
引用
收藏
页码：185 / 188
页数：4
相关论文
共 50 条
  • [21] Computing partial hypergraphs of bounded width
    Adrar, Nabil
    Jegou, Philippe
    Terrioux, Cyril
    DISCRETE APPLIED MATHEMATICS, 2023, 329 : 1 - 22
  • [22] Bounded colorings of multipartite graphs and hypergraphs
    Kamcev, Nina
    Sudakov, Benny
    Volec, Jan
    EUROPEAN JOURNAL OF COMBINATORICS, 2017, 66 : 235 - 249
  • [23] ON GROUPS ADMITTING A GROUP OF AUTOMORPHISMS WHOSE CENTRALIZER HAS BOUNDED RANK
    Mazurov, V. D.
    Khukhro, E. I.
    SIBERIAN ELECTRONIC MATHEMATICAL REPORTS-SIBIRSKIE ELEKTRONNYE MATEMATICHESKIE IZVESTIYA, 2006, 3 : 257 - 283
  • [24] On the Transversal Number of Rank k Hypergraphs
    Tang, Zhongzheng
    Diao, Zhuo
    FRONTIERS OF ALGORITHMIC WISDOM, IJTCS-FAW 2022, 2022, 13461 : 162 - 175
  • [25] A GROUP-TESTING PROBLEM
    KUMAR, S
    ANNALS OF MATHEMATICAL STATISTICS, 1965, 36 (03): : 1079 - &
  • [26] A GROUP-TESTING PROBLEM
    CHANG, GJ
    HWANG, FK
    SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1980, 1 (01): : 21 - 24
  • [27] A GROUP-TESTING PROBLEM
    KUMAR, S
    ANNALS OF MATHEMATICAL STATISTICS, 1965, 36 (02): : 727 - &
  • [28] Efficient testing of hypergraphs
    Kohayakawa, Y
    Nagle, B
    Rödl, V
    AUTOMATA, LANGUAGES AND PROGRAMMING, 2002, 2380 : 1017 - 1028
  • [29] On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs
    Khachiyan, Leonid
    Boros, Endre
    Elbassioni, Khaled
    Gurvich, Vladimir
    THEORETICAL COMPUTER SCIENCE, 2007, 382 (02) : 139 - 150
  • [30] HYPERGRAPHS NOT CONTAINING A TIGHT TREE WITH A BOUNDED TRUNK
    Furedi, Zoltan
    Jiang, Tao
    Kostochka, Alexandr
    Mubayi, Dhruv
    Verstraete, Jacques
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2019, 33 (02) : 862 - 873
12345