A finding Shortest Paths in a Two-level Graph
Gespeichert in:
| Datum: | 2014 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | Englisch |
| Veröffentlicht: |
2014
|
| Schriftenreihe: | Artificial intelligence |
| Online Zugang: | http://jnas.nbuv.gov.ua/article/UJRN-0000357448 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Назва журналу: | Library portal of National Academy of Sciences of Ukraine | LibNAS |
Institution
Library portal of National Academy of Sciences of Ukraine | LibNAS| _version_ | 1859529874979422208 |
|---|---|
| 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 |
| collection | Open-Science |
| first_indexed | 2025-07-22T07:06:31Z |
| format | Article |
| id | open-sciencenbuvgovua-72932 |
| institution | Library portal of National Academy of Sciences of Ukraine | LibNAS |
| language | English |
| last_indexed | 2025-07-22T07:06:31Z |
| publishDate | 2014 |
| record_format | dspace |
| series | Artificial intelligence |
| 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 |
| spellingShingle | Artificial intelligence H. V. Bilyk I. S. Hrunskyi N. V. Nohina A finding Shortest Paths in a Two-level Graph |
| title | 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_short | A finding Shortest Paths in a Two-level Graph |
| title_sort | finding shortest paths in a two-level graph |
| 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 |