{"id":"https://openalex.org/W4242985607","doi":"https://doi.org/10.1134/s000511791812010x","title":"The Decomposition Problem for the Set of Paths in a Directed Graph and Its Application","display_name":"The Decomposition Problem for the Set of Paths in a Directed Graph and Its Application","publication_year":2018,"publication_date":"2018-12-01","ids":{"openalex":"https://openalex.org/W4242985607","doi":"https://doi.org/10.1134/s000511791812010x"},"language":"en","primary_location":{"id":"doi:10.1134/s000511791812010x","is_oa":false,"landing_page_url":"https://doi.org/10.1134/s000511791812010x","pdf_url":null,"source":{"id":"https://openalex.org/S134188425","display_name":"Automation and Remote Control","issn_l":"0005-1179","issn":["0005-1179","1608-3032"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320267","host_organization_name":"Pleiades Publishing","host_organization_lineage":["https://openalex.org/P4310320267","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Pleiades Publishing","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Automation and Remote Control","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5076378279","display_name":"Damir Gainanov","orcid":"https://orcid.org/0000-0002-9218-2301"},"institutions":[{"id":"https://openalex.org/I45571689","display_name":"Moscow Aviation Institute","ror":"https://ror.org/033zpbv42","country_code":"RU","type":"education","lineage":["https://openalex.org/I45571689"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"D. N. Gainanov","raw_affiliation_strings":["Moscow Aviation Institute (National State University), Moscow, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Moscow Aviation Institute (National State University), Moscow, Russia","institution_ids":["https://openalex.org/I45571689"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006307811","display_name":"A. I. Kibzun","orcid":"https://orcid.org/0000-0002-6321-5565"},"institutions":[{"id":"https://openalex.org/I45571689","display_name":"Moscow Aviation Institute","ror":"https://ror.org/033zpbv42","country_code":"RU","type":"education","lineage":["https://openalex.org/I45571689"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"A. I. Kibzun","raw_affiliation_strings":["Moscow Aviation Institute (National State University), Moscow, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Moscow Aviation Institute (National State University), Moscow, Russia","institution_ids":["https://openalex.org/I45571689"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013081744","display_name":"V. A. Rasskazova","orcid":"https://orcid.org/0000-0003-4943-3133"},"institutions":[{"id":"https://openalex.org/I45571689","display_name":"Moscow Aviation Institute","ror":"https://ror.org/033zpbv42","country_code":"RU","type":"education","lineage":["https://openalex.org/I45571689"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"V. A. Rasskazova","raw_affiliation_strings":["Moscow Aviation Institute (National State University), Moscow, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Moscow Aviation Institute (National State University), Moscow, Russia","institution_ids":["https://openalex.org/I45571689"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5076378279"],"corresponding_institution_ids":["https://openalex.org/I45571689"],"apc_list":null,"apc_paid":null,"fwci":0.858,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.78356781,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":97},"biblio":{"volume":"79","issue":"12","first_page":"2217","last_page":"2236"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9945999979972839,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.6270124912261963},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5789515376091003},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5581221580505371},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5522138476371765},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.5065447092056274},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.4995710849761963},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.48239433765411377},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4677213728427887},{"id":"https://openalex.org/keywords/table","display_name":"Table (database)","score":0.4449827969074249},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4375864565372467},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4221765995025635},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.41459769010543823},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39067742228507996},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32563406229019165},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1747109591960907},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.0777425765991211}],"concepts":[{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.6270124912261963},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5789515376091003},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5581221580505371},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5522138476371765},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.5065447092056274},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.4995710849761963},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48239433765411377},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4677213728427887},{"id":"https://openalex.org/C45235069","wikidata":"https://www.wikidata.org/wiki/Q278425","display_name":"Table (database)","level":2,"score":0.4449827969074249},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4375864565372467},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4221765995025635},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.41459769010543823},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39067742228507996},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32563406229019165},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1747109591960907},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0777425765991211},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1134/s000511791812010x","is_oa":false,"landing_page_url":"https://doi.org/10.1134/s000511791812010x","pdf_url":null,"source":{"id":"https://openalex.org/S134188425","display_name":"Automation and Remote Control","issn_l":"0005-1179","issn":["0005-1179","1608-3032"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320267","host_organization_name":"Pleiades Publishing","host_organization_lineage":["https://openalex.org/P4310320267","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Pleiades Publishing","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Automation and Remote Control","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W216893411","https://openalex.org/W2094145958","https://openalex.org/W2514762570","https://openalex.org/W2554768441","https://openalex.org/W2556401332","https://openalex.org/W4210431029"],"related_works":["https://openalex.org/W2380059383","https://openalex.org/W2063679720","https://openalex.org/W2067481825","https://openalex.org/W2075046161","https://openalex.org/W2185495545","https://openalex.org/W2547083368","https://openalex.org/W2031856784","https://openalex.org/W2510721029","https://openalex.org/W3006241023","https://openalex.org/W2028438572"],"abstract_inverted_index":{"We":[0,70,93],"consider":[1],"the":[2,6,19,26,52,63,67,73,76,86,89,96],"problem":[3,24],"of":[4,8,21,30,36,41,65,72,75,88,98],"decomposing":[5],"set":[7,35,40],"paths":[9,37],"in":[10],"a":[11,33,39,47,58],"directed":[12],"graph":[13,53],"and":[14,28,38],"its":[15],"application":[16],"to":[17,84],"reducing":[18],"dimension":[20,87],"an":[22],"applied":[23,91],"on":[25,62],"assignment":[27],"transportation":[29],"locomotives.":[31],"On":[32],"given":[34],"strongly":[42],"connected":[43],"subgraphs,":[44],"we":[45,56],"define":[46],"special":[48],"table.":[49,69],"To":[50],"solve":[51],"decomposition":[54],"problem,":[55],"develop":[57],"heuristic":[59],"algorithm":[60],"based":[61],"idea":[64],"quicksorting":[66],"constructed":[68],"estimate":[71],"complexity":[74],"resulting":[77],"algorithm.":[78],"The":[79],"obtained":[80],"results":[81,97],"were":[82],"used":[83],"reduce":[85],"above-mentioned":[90],"problem.":[92],"also":[94],"show":[95],"computational":[99],"experiments.":[100]},"counts_by_year":[{"year":2021,"cited_by_count":4}],"updated_date":"2026-06-18T10:00:31.954636","created_date":"2025-10-10T00:00:00"}