A revised algorithm for searching for all defective edges in a graph (Q765324): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3994535 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Group Testing Problem on Two Disjoint Sets / 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: Competitive group testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A competitive algorithm to find all defective edges in a graph / 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 23:49, 4 July 2024

scientific article
Language Label Description Also known as
English
A revised algorithm for searching for all defective edges in a graph
scientific article

    Statements

    A revised algorithm for searching for all defective edges in a graph (English)
    0 references
    0 references
    19 March 2012
    0 references
    group testing
    0 references
    graph testing
    0 references
    defective edges
    0 references
    competitive algorithm
    0 references

    Identifiers