Hardness of reoptimization of the problem of calculating the chromatic number of a graph with a given set of optimal solutions
Saved in:
| Date: | 2016 |
|---|---|
| Main Author: | V. A. Mikhajljuk |
| Format: | Article |
| Language: | English |
| Published: |
2016
|
| Series: | Cybernetics and Systems Analysis |
| Online Access: | http://jnas.nbuv.gov.ua/article/UJRN-0000502502 |
| 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
-
Chromatic number of graphs with special distance sets, I
by: Yegnanarayanan, V.
Published: (2018) -
Chromatic number of graphs with special distance sets, I
by: V. Yegnanarayanan
Published: (2014) -
Chromatic number of graphs with special distance sets, I
by: Yegnanarayanan, V.
Published: (2014) -
Local distance antimagic chromatic number for the union of star and double star graphs
by: V. Priyadharshini, et al.
Published: (2023) -
Finding the Optimal Solution to the Problem of Conditional Optimization on the Graph of the set of Placements
by: A. M. Nahirna, et al.
Published: (2020)