Skip to main content
SpringerLink
Log in

Experimental Analysis of the Multidimensional-Matrix Approach to Construct Routes in a Graph

  • Published:
Russian Microelectronics Aims and scope Submit manuscript

Abstract—

The algorithms for calculating the weights of routes between all pairs of graph vertices have polynomial computational complexity. However, the construction of the routes themselves belongs to the NP class. The heuristic algorithms that allow reducing the computational complexity of this problem, as a rule, require careful statistical analysis to prove their effectiveness, are focused on specific types of graphs, and require artificial tricks for their parallel implementation. In this paper, an experimental analysis of the approach to construct routes in a graph based on the algebra of multidimensional matrices is carried out. The proposed approach, based on the (1, 0)-convoluted product of multidimensional matrices, makes it possible to find all possible routes in a graph and implement parallel computations due to the natural parallelism inherent in matrix algebra. In addition, since the algebra of multidimensional matrices is isomorphic to relational algebra under the conditions of the problem of constructing routes, the possibility of parallel implementation of work with sparse matrices using database technology is shown. An experimental analysis of the implementation of the proposed approach based on the software developed in the programming environment using C++ and the relational database tools PostgreSQL and Microsoft SQL Server is presented. The proposed approach allows us to set up a one-to-one correspondence between the data model and the computational model.

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

Fig. 1.
Fig. 2.
Fig. 3.

REFERENCES

  1. Bast, H., Car or public transport—Two worlds, Efficient Algorithms, Albers, S., Alt, H., and Näher, S., Eds., Lecture Notes in Computer Science, vol. 5760, Berlin: Springer, 2009, pp. 355–367. https://doi.org/10.1007/978-3-642-03456-5_24

    Book  Google Scholar 

  2. Belyakov, S.L., Kolomiitsev, Ya.A., Rozenberg, I.N., and Savel’eva, M.N., Model for solving routing problem in the intellectual geoinformation system, Izv. Yuzhnogo Fed. Univ., Tekh. Nauki, 2011, no. 5 (118), pp. 113–119.

  3. Ageyev, D., Ignatenko, A., and Wehbe, F., Design of information and telecommunication systems with the usage of the multi-layer graph model, 12th Int. Conf. on the Experience of Designing and Application of CAD Systems in Microelectronics (CADSM), Lviv, Ukraine, 2013, IEEE, 2013, pp. 1–4.

  4. Margolis, B.I. and Muzanna, M.M., Synthesis of mainstream telecommunication systems, Program. Prod. Sist., 2014, no. 1, pp. 162–168.

  5. Miller, J.A., Ramaswamy, L., Kochut, K.J., and Fard, A., Research directions for big data graph analytics, 2015 IEEE Int. Congress on Big Data, New York, 2015, IEEE, 2015, pp. 785–794. https://doi.org/10.1109/BigDataCongress.2015.132

  6. Spivak, S.I., Ismagilova, A.S., and Khamitova, I.A., Graph-theoretical method for determining routes of complex chemical reactions, Dokl. Phys. Chem., 2010, vol. 434, no. 4, pp. 169–171. https://doi.org/10.1134/S0012501610100040

    Article  CAS  Google Scholar 

  7. Masum, A.K., Faruque, F., Shahjalal, M., and Sarker, I.H., Solving the vehicle routing problem using genetic algorithm, Int. J. Adv. Comput. Sci. Appl., 2011, vol. 2, no. 7, pp. 126–131. https://doi.org/10.14569/IJACSA.2011.020719

    Article  Google Scholar 

  8. Semenov, Yu.N. and Semenova, O.S., The use of clustering methods in the organization of long-distance transport of goods, Vestn. Kuzbasskogo Gos. Tekh. Univ., 2016, no. 6 (118), pp. 201–205.

  9. Munerman, V.I. and Samoilova, T.A., Algebraic approach to algorithmization of routing problems, Sist. Vysokoi Dostupnosti, 2018, vol. 14, no. 5, pp. 50–56. https://doi.org/10.18127/j20729472-201805-08

    Article  Google Scholar 

  10. Sokolov, N.P., Vvedenie v teoriyu mnogomernykh matrits (Introduction to the Theory of Multidimensional Matrices), Kiev: Naukova Dumka, 1972.

  11. Levin, N.A. and Munerman, V.I., Models for processing big amounts of data in mass-parallel systems, Sist. Vysokoi Dostupnosti, 2013, vol. 9, no. 1, pp. 35–43.

    Google Scholar 

  12. Munerman, V.I., Construction of hardware-software complexes architecture to improve massively data processing, Sist. Vysokoi Dostupnosti, 2015, vol. 11, no. 2, pp. 13–18.

    Google Scholar 

  13. Zakharov, V.N. and Munerman, V.I., Parallel algorithm of matrix multiplication, Sovrem. Inf. Tekhnol. IT-Obraz., 2015, vol. 11, no. 2, pp. 384–390.

    Google Scholar 

  14. Yemelchenkov, E.P., Munerman, V.I., Munerman, D.V., and Samoylova, T.A., A method of cycle construction in graph, Sovrem. Inf. Tekhnol. IT-Obraz., 2021, vol. 17, no. 4, pp. 814–823. http://sitito.cs.msu.ru/index.php/ SITITO/article/view/773https://doi.org/10.25559/SITITO.17.202104.814-823

    Article  Google Scholar 

  15. Munerman, V. and Munerman, D., An axiomatic approach to the data models formalization for mass data processing, 2020 IEEE Conference Of Russian Young Researchers In Electrical And Electronic Engineering (ElConRus), St. Petersburg, 2020, IEEE, 2020, pp. 1996–2000. https://doi.org/10.1109/EIConRus49466.2020.9039205

  16. Munerman, V.I. and Munerman, D.V., About the correspondence of data models and calculation models, Sist. Komp’yuternoi Mat. Ikh Prilozheniya, 2021, no. 22, pp. 146–152.

  17. Zakharov, V.N. and Munerman, V.I., Parallel implementation of processing the intensely used data on the basis of algebras of multidimensional matices, Analitika i upravlenie dannymi v oblastyakh s intensivnym ispol’zovaniem dannykh. XVII Mezhdunarodnaya konferentsiya DAMDID/RCDL (Analytics and Data Management in Areas with Intense Data Use: 17th Int. Conf. DAMDID/RCDL), Obninsk, Kaluga oblast: Obninsk. Inst. At. Enrgetiki Nats. Issled. Yadernyi Univ. MIFI, 2015, pp. 217–223.

  18. Antonov, A.S., Parallel’noe programmirovanie s ispol’zovaniem tekhnologii OpenMP. Uchebnoe posobie (Parallel Programming Using OpenMP Technology: Textbook), Moscow: Mosk. Gos. Univ. im. Lomonosova, 2009.

  19. Kozlov, S.V., Intelligent system of decision making support “Advanced Tester,” Komp’yuternaya integratsiya proizvodstva i IPI-tekhnologii. Sb. materialov X Vseross. konf. (Computer Integration of Production and IPI Technology: Proc. 10th All-Russian Conf.), Orenburg, 2021, Orenburg: Orenburg. Gos. Univ., 2021, pp. 127–131.

  20. Kozlov, S.V., Interpretation of invariants of the theory of counts in the context of use of compliance of Galois at creation and support of information systems, Int. J. Open Inf. Technol., 2016, vol. 4, no. 7, pp. 38–44.

    Google Scholar 

Download references

Funding

This work was supported by ongoing institutional funding. No additional grants to carry out or direct this particular research were obtained.

Author information

Authors and Affiliations

  1. Smolensk State University, 214000, Smolensk, Russia

    S. A. Morozov, V. I. Munerman & V. A. Simakov

Authors
  1. S. A. Morozov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. I. Munerman
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. V. A. Simakov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to V. I. Munerman.

Ethics declarations

The authors declare that they have no conflicts of interest.

Additional information

Publisher’s Note.

Pleiades Publishing remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Morozov, S.A., Munerman, V.I. & Simakov, V. Experimental Analysis of the Multidimensional-Matrix Approach to Construct Routes in a Graph. Russ Microelectron 52, 716–721 (2023). https://doi.org/10.1134/S1063739723070119

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S1063739723070119

Keywords:

Search

Navigation