메뉴 건너뛰기




Volumn 117, Issue 1-3, 2002, Pages 99-108

A group testing problem for graphs with several defective edges

Author keywords

Grouptesting; Information theoretic lower bound; Searchproblems

Indexed keywords


EID: 84867939578     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(01)00181-0     Document Type: Article
Times cited : (14)

References (7)
  • 4
    • 0040777566 scopus 로고
    • A tight upper bound for group testing in graphs
    • P. Damaschke A tight upper bound for group testing in graphs Discrete Appl. Math. 48 1994 101 109
    • (1994) Discrete Appl. Math. , vol.48 , pp. 101-109
    • Damaschke, P.1
  • 6
    • 84867993570 scopus 로고
    • Group testing with two defectives
    • H.P. Yap, Proceedings of the Spring School and International Conference on Combinatorics, Hefei, China, 6-27 April 1992 World Scientific Singapore
    • X. Li Group testing with two defectives H.P. Yap, Combinatorics and Graph Theory Proceedings of the Spring School and International Conference on Combinatorics, Hefei, China, 6-27 April 1992 1993 World Scientific Singapore 229 243
    • (1993) Combinatorics and Graph Theory , pp. 229-243
    • Li, X.1
  • 7
    • 0041673879 scopus 로고    scopus 로고
    • A group testing problem for hypergraphs of bounded rank
    • DOI 10.1016/0166-218X(95)00120-G
    • E. Triesch A group testing problem for hypergraphs of bounded rank Discrete Appl. Math. 66 1996 185 188 (Pubitemid 126374620)
    • (1996) Discrete Applied Mathematics , vol.66 , Issue.2 , pp. 185-188
    • Triesch, E.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.