2025-02-22T17:12:37-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: Query fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22open-sciencenbuvgovua-45987%22&qt=morelikethis&rows=5
2025-02-22T17:12:37-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: => GET http://localhost:8983/solr/biblio/select?fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22open-sciencenbuvgovua-45987%22&qt=morelikethis&rows=5
2025-02-22T17:12:37-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: <= 200 OK
2025-02-22T17:12:37-05:00 DEBUG: Deserialized SOLR response
Formulations of problems for k-node shortest path and k-node shortest cycle in a complete graph
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
2016
|
| Series: | Cybernetics and Systems Analysis |
| Online Access: | http://jnas.nbuv.gov.ua/article/UJRN-0000460182 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| id |
open-sciencenbuvgovua-45987 |
|---|---|
| record_format |
dspace |
| spelling |
open-sciencenbuvgovua-459872024-02-29T12:35:48Z Formulations of problems for k-node shortest path and k-node shortest cycle in a complete graph P. I. Stetsjuk 1019-5262 2016 en Cybernetics and Systems Analysis http://jnas.nbuv.gov.ua/article/UJRN-0000460182 Article |
| institution |
Library portal of National Academy of Sciences of Ukraine | LibNAS |
| collection |
Open-Science |
| language |
English |
| series |
Cybernetics and Systems Analysis |
| spellingShingle |
Cybernetics and Systems Analysis P. I. Stetsjuk Formulations of problems for k-node shortest path and k-node shortest cycle in a complete graph |
| format |
Article |
| author |
P. I. Stetsjuk |
| author_facet |
P. I. Stetsjuk |
| author_sort |
P. I. Stetsjuk |
| title |
Formulations of problems for k-node shortest path and k-node shortest cycle in a complete graph |
| title_short |
Formulations of problems for k-node shortest path and k-node shortest cycle in a complete graph |
| title_full |
Formulations of problems for k-node shortest path and k-node shortest cycle in a complete graph |
| title_fullStr |
Formulations of problems for k-node shortest path and k-node shortest cycle in a complete graph |
| title_full_unstemmed |
Formulations of problems for k-node shortest path and k-node shortest cycle in a complete graph |
| title_sort |
formulations of problems for k-node shortest path and k-node shortest cycle in a complete graph |
| publishDate |
2016 |
| url |
http://jnas.nbuv.gov.ua/article/UJRN-0000460182 |
| work_keys_str_mv |
AT pistetsjuk formulationsofproblemsforknodeshortestpathandknodeshortestcycleinacompletegraph |
| first_indexed |
2024-03-30T09:48:51Z |
| last_indexed |
2024-03-30T09:48:51Z |
| _version_ |
1796882071223795712 |