A competitive algorithm to find all defective edges in a graph (Q2486071): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Search problems on graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Group Testing Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A tight upper bound for group testing in graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4506360 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A group testing problem for graphs with several defective edges / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A group testing problem for hypergraphs of bounded rank / rank | |||
Normal rank |
Latest revision as of 13:58, 10 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A competitive algorithm to find all defective edges in a graph |
scientific article |
Statements
A competitive algorithm to find all defective edges in a graph (English)
0 references
5 August 2005
0 references
Group testing
0 references
Graph testing
0 references
Competitive algorithm
0 references