On complete and quasi-complete two-criteria optimization problems on graphs
Saved in:
| Date: | 2018 |
|---|---|
| Main Authors: | V. A. Perepelitsa, E. V. Tereshchenko |
| Format: | Article |
| Language: | English |
| Published: |
2018
|
| Series: | Cybernetics and Systems Analysis |
| Online Access: | http://jnas.nbuv.gov.ua/article/UJRN-0000863958 |
| 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
-
Solvability of NP-complete problems
by: O. A. Vahis, et al.
Published: (2022) -
Detection of optimal hierarchy in a quasi-hierarchical graph by centrality criteria
by: Sulema, O. K., et al.
Published: (2015) -
On \(k\)-graceful labeling of pendant edge extension of complete bipartite graphs
by: Bhoumik, Soumya, et al.
Published: (2018) -
On k-graceful labeling of pendant edge extension of complete bipartite graphs
by: Bhoumik, S., et al.
Published: (2018) -
The completeness of the algorithm algebra with data
by: V. G. Akulovskij, et al.
Published: (2016)