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 条
  • [1] EDGE SEARCH IN GRAPHS AND HYPERGRAPHS OF BOUNDED RANK
    ALTHOFER, I
    TRIESCH, E
    [J]. DISCRETE MATHEMATICS, 1993, 115 (1-3) : 1 - 9
  • [2] Isomorphism Testing for Graphs of Bounded Rank Width
    Grohe, Martin
    Schweitzer, Pascal
    [J]. 2015 IEEE 56TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 2015, : 1010 - 1029
  • [3] HYPERGRAPHS OF BOUNDED DISJOINTNESS
    Scott, Alex
    Wilmer, Elizabeth
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2014, 28 (01) : 372 - 384
  • [4] DECOMPOSITIONS OF QUASIRANDOM HYPERGRAPHS INTO HYPERGRAPHS OF BOUNDED DEGREE
    Ehard, Stefan
    Joos, Felix
    [J]. TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 2022, 375 (10) : 7035 - 7119
  • [5] Partial degree bounded edge packing problem for graphs and -uniform hypergraphs
    Aurora, Pawan
    Singh, Sumit
    Mehta, Shashank K.
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2016, 32 (01) : 159 - 173
  • [6] Group Testing in Arbitrary Hypergraphs and Related Combinatorial Structures
    De Bonis, Annalisa
    [J]. SOFSEM 2024: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2024, 14519 : 154 - 168
  • [7] The automorphism group of the infinite-rank free group is coarsely bounded
    Domat, George
    Hoganson, Hannah
    Kwak, Sanghoon
    [J]. NEW YORK JOURNAL OF MATHEMATICS, 2022, 28 : 1506 - 1511
  • [8] Trinque problem: covering complete graphs by plane degree-bounded hypergraphs
    Clément Charpentier
    Sylvain Gravier
    Thomas Lecorre
    [J]. Journal of Combinatorial Optimization, 2017, 33 : 543 - 550
  • [9] Trinque problem: covering complete graphs by plane degree-bounded hypergraphs
    Charpentier, Clement
    Gravier, Sylvain
    Lecorre, Thomas
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2017, 33 (02) : 543 - 550
  • [10] On Subgraphs of Bounded Degeneracy in Hypergraphs
    Dutta, Kunal
    Ghosh, Arijit
    [J]. GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, WG 2016, 2016, 9941 : 295 - 306
12345