Group testing in graphs (Q2471072): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-007-9068-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2019811762 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Search problems on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge search in graphs and hypergraphs of bounded rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Group Testing Problem / 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: Group testing in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group testing with two defectives / 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: Q4163243 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sequential Method for Screening Experimental Variables / rank
 
Normal rank

Latest revision as of 17:06, 27 June 2024

scientific article
Language Label Description Also known as
English
Group testing in graphs
scientific article

    Statements