{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T23:04:27Z","timestamp":1773615867667,"version":"3.50.1"},"reference-count":9,"publisher":"Allerton Press","issue":"7","license":[{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Aut. Control Comp. Sci."],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.3103\/s0146411622070215","type":"journal-article","created":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T09:03:26Z","timestamp":1676797406000},"page":"807-814","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Identification Conditions for the Solvability of NP-Complete Problems for the Class of Prefractal Graphs"],"prefix":"10.3103","volume":"56","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9791-142X","authenticated-orcid":false,"given":"A. V.","family":"Tymoshenko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3186-3901","authenticated-orcid":false,"given":"R. A.","family":"Kochkarov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3232-5331","authenticated-orcid":false,"given":"A. A.","family":"Kochkarov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1627","published-online":{"date-parts":[[2023,2,19]]},"reference":[{"key":"7534_CR1","doi-asserted-by":"publisher","first-page":"1590","DOI":"10.1134\/S0965542515090080","volume":"55","author":"A. Kochkarov","year":"2015","unstructured":"Kochkarov, A., Kochkarov, R., and Malinetskii, G., Issues of dynamic graph theory, Comput. Math. Math. Phys., 2015, vol. 55, no. 9, pp. 1590\u20131596. \u00a0https:\/\/doi.org\/10.1134\/S0965542515090080","journal-title":"Comput. Math. Math. Phys."},{"key":"7534_CR2","first-page":"117","volume":"17","author":"S.N. Pupyrev","year":"2010","unstructured":"Pupyrev, S.N. and Tikhonov, A.V., The analysis of complex networks with dynamic graph visualization, Model. Anal. Inf. Sist., 2010, vol. 17, no. 1, pp. 117\u2013135.","journal-title":"Model. Anal. Inf. Sist."},{"key":"7534_CR3","doi-asserted-by":"publisher","first-page":"678","DOI":"10.3103\/S0146411617070264","volume":"51","author":"Y. Belov","year":"2016","unstructured":"Belov, Y. and Vovchok, S., Generation of a social network graph by using Apache Spark, Autom. Control Comput. Sci., 2016, vol. 51, no. 7, pp. 678\u2013681. \u00a0https:\/\/doi.org\/10.3103\/S0146411617070264","journal-title":"Autom. Control Comput. Sci."},{"key":"7534_CR4","doi-asserted-by":"publisher","first-page":"75","DOI":"10.18255\/1818-1015-2019-1-75-89","volume":"26","author":"S. Morzhov","year":"2019","unstructured":"Morzhov, S. and Sokolov, V., An effective algorithm for collision resolution in security policy rules, Model. Anal. Inf. Sist., 2019, vol. 26, no. 1, pp. 75\u201389. \u00a0https:\/\/doi.org\/10.18255\/1818-1015-2019-1-75-89","journal-title":"Model. Anal. Inf. Sist."},{"key":"7534_CR5","volume-title":"Recognition of Fractal Graphs. Algorithmic Approach","author":"A.M. Kochkarov","year":"1998","unstructured":"Kochkarov, A.M., Perepelitsa, V.A., and Sergienko, I.V., Recognition of Fractal Graphs. Algorithmic Approach, RAS SAO, 1998."},{"key":"7534_CR6","unstructured":"Kochkarov, R.A., Problems of multicriteria optimization on multi-weighted prefractal graphs, Akademinnovatsiya, 2014, no. 17, pp. 319\u2013328."},{"key":"7534_CR7","doi-asserted-by":"publisher","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"F. Harary","year":"1969","unstructured":"Harary, F., Graph Theory, Addison-Wesley, 1969."},{"key":"7534_CR8","doi-asserted-by":"publisher","first-page":"144","DOI":"10.18255\/1818-1015-2012-4-144-153","volume":"19","author":"M.A. Iordanskii","year":"2012","unstructured":"Iordanskii, M.A., Constructive classification of graphs, Model. Anal. Inf. Sist., 2012, vol.\u00a019, no. 4, pp. 144\u2013153.","journal-title":"Model. Anal. Inf. Sist."},{"key":"7534_CR9","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R. and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Company, 1979."}],"container-title":["Automatic Control and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.3103\/S0146411622070215.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.3103\/S0146411622070215","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.3103\/S0146411622070215.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T22:05:51Z","timestamp":1773612351000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.3103\/S0146411622070215"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12]]},"references-count":9,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["7534"],"URL":"https:\/\/doi.org\/10.3103\/s0146411622070215","relation":{},"ISSN":["0146-4116","1558-108X"],"issn-type":[{"value":"0146-4116","type":"print"},{"value":"1558-108X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12]]},"assertion":[{"value":"9 March 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 April 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 May 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 February 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no conflicts of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"CONFLICT OF INTEREST"}}]}}