scientific article
From MaRDI portal
Publication:3977472
zbMath0747.05084MaRDI QIDQ3977472
Publication date: 25 June 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
polynomial time algorithmgameworst-case complexityrecognition complexityadmissible testsidentification complexity
Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (3)
On a group testing problem: characterization of graphs with 2-complexity and maximum number of edges ⋮ Searching for an edge in a graph with restricted test sets ⋮ Edge search in graphs with restricted test sets
This page was built for publication:
