On the shortest k-node path in a directed graph
Saved in:
| Date: | 2016 |
|---|---|
| Main Authors: | P. I. Stetsjuk, E. S. Dolinskij, I. I. Parasjuk |
| Format: | Article |
| Language: | English |
| Published: |
2016
|
| Series: | Teoriia optymalnykh rishen |
| Online Access: | http://jnas.nbuv.gov.ua/article/UJRN-0000575163 |
| 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 | LibNASSimilar Items
-
Formulations of problems for k-node shortest path and k-node shortest cycle in a complete graph
by: P. I. Stetsjuk
Published: (2016) -
The shortest k-node path
by: P. I. Stetsjuk, et al.
Published: (2015) -
Problems on Shortest k-Node Cycles and Paths
by: P. I. Stetsiuk, et al.
Published: (2021) -
A finding Shortest Paths in a Two-level Graph
by: H. V. Bilyk, et al.
Published: (2014) -
Algorithm for word segmentation based on the shortest path algorithm inside a graph
by: D. V. Lande, et al.
Published: (2017)