Skip to main content
SpringerLink
Log in

Graph Approach to Solving Problems of Combinatorial Recognition

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. G. P. Donets, V. A. Pepelyaev, and O. M. Trofimchuk, “Combinatorial algorithms for supporting managerial decision making,” Reports of the National Academy of Sciences of Ukraine, No. 11, 33–39 (2014).

  2. G. P. Donets, “Problems of combinatorial recognition,” in: Proc. XVIth Intern. Conf. “Problems of Theoretical Cybernetics,” Nizhni Novgorod (2011), pp. 142–144.

  3. G. P. Donets, “Combinatorial recognition methods,” in: Proc. Intern. Conf. “Mathematical modeling, optimization, and information technologies,” Kishinev (2010), pp. 142–147.

  4. V. I. Biletsky, G. P. Donets, and E. I. Nenakhov, “Combinatorial recognition: Problems and their solution,” in: Collection of Scientific Papers “Theory of optimal decisions,” Iss. 2012 (2012), pp. 21–29.

  5. G. P. Donets and S. T. Kuznetsov, “A combinatorial problem of logical type,” in: Collection of Scientific Papers “Theory of optimal decisions,” Iss. 2012 (2012), pp. 101–108.

  6. G. P. Donets, V. I. Biletsky, and E. I. Nenakhov, “Graph approach to the solution of the problem of searching for radioactive balls,” in: Collection of Scientific Papers “Theory of optimal decisions,” Iss. 2014 (2014), pp. 147–154.

  7. G. P. Donets, V. I. Biletsky, and E. I. Nenakhov, “Optimal search for two active balls in a set of given balls,” in: Collection of Scientific Papers “Theory of optimal decisions,” Iss. 2015 (2015), pp. 134–139.

  8. V. I. Biletsky and E. I. Nenakhov, “Algorithms for searching for two active balls in given sets,” in: Collection of Scientific Papers “Theory of optimal decisions,” Iss. 2016 (2016), pp. 78–85.

Download references

Author information

Authors and Affiliations

  1. V. M. Glushkov Institute of Cybernetics, National Academy of Sciences of Ukraine, Kyiv, Ukraine

    G. A. Donets

Authors
  1. G. A. Donets
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to G. A. Donets.

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 6, November–December, 2017, pp. 44–53.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Donets, G.A. Graph Approach to Solving Problems of Combinatorial Recognition. Cybern Syst Anal 53, 857–865 (2017). https://doi.org/10.1007/s10559-017-9987-6

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-017-9987-6

Keywords

Search

Navigation