Open AccessMethod of optimizing the search for a path in a graph by rejecting unnecessary nodes
Author(s) -
С.С. Бучик,
І. В. Пулеко,
І. В. Половніков
Publication year - 2018
Publication title -
naukoêmnì tehnologìï/naukoêmni tehnologìï
Language(s) - English
Resource type - Journals
eISSN - 2310-5461
pISSN - 2075-0781
DOI - 10.18372/2310-5461.37.12364
Subject(s) - transitive closure , computer science , path (computing) , graph , relation (database) , software , transitive relation , theoretical computer science , mathematical optimization , algorithm , data mining , mathematics , programming language , combinatorics