Skip to main content
SpringerLink
Log in

Undirected Mixed-Forest Graphs. Constructing Isomorphic Analogs and Selective Structure Packing

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

Methods and algorithms are developed that made it possible to significantly expand the functionality and practical application scope of the new universal information software technology being created. All of them are implemented in 32 software modules and are designed for the most efficient construction of isomorphic analogs of objects that are a variation of the arbitrary structure of undirected mixed-forest graphs, as well as for the simultaneous removal of selectively chosen sets of nodes and branches from them. To work efficiently on objects containing up to 65536 nodes, which can be placed at 6400 virtual X-levels of a monitor screen, the technology requires only 4 bytes of information on each node, taking into account its personal number, which is a natural number from the interval [0; 65535]. A method is developed and implemented that allows adapting the technology for working with objects with up to 4 1019 nodes that it can recognize.

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. A. I. Ivaneshkin, “Universal information software technology for non-oriented mixed forests,” Cybern. Syst. Analysis, Vol. 58, No. 3, 465–472 (2022). https://doi.org/https://doi.org/10.1007/s10559-022-00477-8.

    Article  MathSciNet  MATH  Google Scholar 

  2. A. I. Ivaneshkin, “The solution of the question of the isomorphism of non-oriented trees by the method of generating isomorphic structures,” J. Autom. Inform. Sci., Vol. 52, Iss. 8, 68–79 (2020). https://doi.org/10.1615/JAutomatInfScien.v52.i8.60.

  3. A. I. Ivaneshkin, “A new approach to operating with undirected trees,” Cybern. Syst. Analysis, Vol. 57, No. 1, 124–132 (2021). https://doi.org/https://doi.org/10.1007/s10559-021-00335-z.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. International Scientific and Training Center of Information Technologies and Systems, National Academy of Sciences of Ukraine and Ministry of Education and Science of Ukraine, Kyiv, Ukraine

    A. I. Ivaneshkin

Authors
  1. A. I. Ivaneshkin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. I. Ivaneshkin.

Additional information

Translated from Kibernetyka ta Systemnyi Analiz, No. 3, May–June, 2023, pp. 168–178

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ivaneshkin, A.I. Undirected Mixed-Forest Graphs. Constructing Isomorphic Analogs and Selective Structure Packing. Cybern Syst Anal 59, 503–510 (2023). https://doi.org/10.1007/s10559-023-00585-z

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-023-00585-z

Keywords

Search

Navigation