Donets G.A.
Graph approach to solving problems of combinatorial recognition

The problem of finding two radioactive balls among a given set of balls is reduced to a combinatorial recognition problem, and the latter is solved by a series of tests. Methods of graph theory are used to solve the problem. The approach is illustrated by an example with 22 balls. © 2017, Springer Science+Business Media, LLC, part of Springer Nature.

Keywords: active ball, active edge, bipartite graph, complete graph, limited sample, negative test result, positive test result, search graph, unlimited sample, Graph theory, active ball, active edge, Bipartite graphs, Complete graphs, negative test result, positive test result, search graph, Problem solving

Cite:
Donets G.A. (2017). Graph approach to solving problems of combinatorial recognition. Cybernetics and Systems Analysis, 53 (6), 44-53. doi: https://doi.org/10.1007/s10559-017-9987-6 http://jnas.nbuv.gov.ua/article/UJRN-0000782699 [In Ukrainian].