A finding Shortest Paths in a Two-level Graph

Saved in:
Bibliographic Details
Date:2014
Main Authors: H. V. Bilyk, I. S. Hrunskyi, N. V. Nohina
Format: Article
Language:English
Published: 2014
Series:Artificial intelligence
Online Access:http://jnas.nbuv.gov.ua/article/UJRN-0000357448
Tags: Add Tag
No Tags, Be the first to tag this record!
Journal Title:Library portal of National Academy of Sciences of Ukraine | LibNAS

Institution

Library portal of National Academy of Sciences of Ukraine | LibNAS
id open-sciencenbuvgovua-72932
record_format dspace
spelling open-sciencenbuvgovua-729322024-04-16T17:10:06Z A finding Shortest Paths in a Two-level Graph H. V. Bilyk I. S. Hrunskyi N. V. Nohina 2710-1673 2014 en Artificial intelligence http://jnas.nbuv.gov.ua/article/UJRN-0000357448 Article
institution Library portal of National Academy of Sciences of Ukraine | LibNAS
collection Open-Science
language English
series Artificial intelligence
spellingShingle Artificial intelligence
H. V. Bilyk
I. S. Hrunskyi
N. V. Nohina
A finding Shortest Paths in a Two-level Graph
format Article
author H. V. Bilyk
I. S. Hrunskyi
N. V. Nohina
author_facet H. V. Bilyk
I. S. Hrunskyi
N. V. Nohina
author_sort H. V. Bilyk
title A finding Shortest Paths in a Two-level Graph
title_short A finding Shortest Paths in a Two-level Graph
title_full A finding Shortest Paths in a Two-level Graph
title_fullStr A finding Shortest Paths in a Two-level Graph
title_full_unstemmed A finding Shortest Paths in a Two-level Graph
title_sort finding shortest paths in a two-level graph
publishDate 2014
url http://jnas.nbuv.gov.ua/article/UJRN-0000357448
work_keys_str_mv AT hvbilyk afindingshortestpathsinatwolevelgraph
AT ishrunskyi afindingshortestpathsinatwolevelgraph
AT nvnohina afindingshortestpathsinatwolevelgraph
AT hvbilyk findingshortestpathsinatwolevelgraph
AT ishrunskyi findingshortestpathsinatwolevelgraph
AT nvnohina findingshortestpathsinatwolevelgraph
first_indexed 2025-07-22T07:06:31Z
last_indexed 2025-07-22T07:06:31Z
_version_ 1850418957796769792