SCOPUS 정보 검색 플랫폼

Volumn 148, Issue 3, 2005, Pages 273-277

A competitive algorithm to find all defective edges in a graph

Author keywords

Competitive algorithm; Graph testing; Group testing

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

COMPETITIVE ALGORITHMS; DEFECTIVE EDGES; GRAPH TESTING; GROUP TESTING;

GRAPH THEORY;

EID: 19944382497 PISSN: 0166218X EISSN: None Source Type: Journal
DOI: 10.1016/j.dam.2005.02.010 Document Type: Article

Times cited : (5)

References (6)

1
- 0022757603
- Search problem on graphs
- M. Aigner Search problem on graphs Discrete Appl. Math. 14 1986 215 230
- (1986) Discrete Appl. Math. , vol.14 , pp. 215-230
- Aigner, M.¹

2
- 0040183164
- A graph testing problem
- G.J. Chang, and F.K. Hwang A graph testing problem SIAM J. Algebraic Discrete Methods 1 1980 21 24
- (1980) SIAM J. Algebraic Discrete Methods , vol.1 , pp. 21-24
- Chang, G.J.¹ Hwang, F.K.²

3
- 0040777566
- 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.¹

4
- 0003391890
- second ed. World Scientific Singapore
- D.Z. Du, and F.K. Hwang Combinational Group Testing and its Applications second ed. 2000 World Scientific Singapore
- (2000) Combinational Group Testing and its Applications
- Du, D.Z.¹ Hwang, F.K.²

5
- 84867939578
- A group testing problem for graphs with several defective edges
- P. Johann A group testing problem for graphs with several defective edges Discrete Appl. Math. 117 2002 97 108
- (2002) Discrete Appl. Math. , vol.117 , pp. 97-108
- Johann, P.¹

6
- 0041673879
- A group testing problem for hypergraphs of bounded rank
- E. Triesch A group testing problem for hypergraphs of bounded rank Discrete Appl. Math. 66 1996 165 188
- (1996) Discrete Appl. Math. , vol.66 , pp. 165-188
- Triesch, E.¹

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