Cover Image

Hardness of reoptimization of the problem of calculating the chromatic number of a graph with a given set of optimal solutions

Saved in:

Bibliographic Details
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 | LibNAS

Similar Items

Chromatic number of graphs with special distance sets, I
by: Yegnanarayanan, V.
Published: (2014)

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)

Local distance antimagic chromatic number for the union of star and double star graphs
by: V. Priyadharshini, et al.
Published: (2023)

Local distance antimagic chromatic number for the union of star and double star graphs
by: Priyadharshini, V., et al.
Published: (2023)

Finding the Optimal Solution to the Problem of Conditional Optimization on the Graph of the set of Placements
by: Koliechkina, L.M., et al.
Published: (2020)

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)

Reoptimization of 2-criteria satisfiability problem
by: V. O. Mykhailiuk, et al.
Published: (2018)

The edge chromatic number of \(\Gamma_{I}(R)\)
by: Kala, R., et al.
Published: (2018)

The edge chromatic number of ΓI(R)
by: Kala, R., et al.
Published: (2017)

Optimal search for two active balls on a given set
by: G. A. Donets, et al.
Published: (2015)

Algebraic Approach to Reoptimization of Combinatorial Optimization Problems and Related Questions of Computational Complexity Evaluation
by: V. O. Mykhailiuk
Published: (2017)

Reoptimization of 2-objective minimum vertex cover problem
by: N. A. Dreichan
Published: (2015)

Finding a given number of solutions to a system of fuzzy constraints
by: M. I. Shlezinger, et al.
Published: (2018)

The detour hull number of a graph
by: Santhakumaran, A.P., et al.
Published: (2012)

The detour hull number of a graph
by: Santhakumaran, A. P., et al.
Published: (2018)

Vector fields with a given set of singular points
by: Prishlyak, O. O., et al.
Published: (1997)

A combined model for finding the shortest cycle to visit a given number of vertices from the graph clusters: an example of application for walking tourism
by: P. Stetsyuk, et al.
Published: (2024)

On the number of topologies on a finite set
by: Kizmaz, M. Yasir
Published: (2019)

On the number of topologies on a finite set
by: Kizmaz, M.Y.
Published: (2019)

Bounds for graphs of given girth and generalized polygons
by: Benkherouf, L., et al.
Published: (2002)

Solution of the task of conditional optimization on a set of combinations
by: A. M. Nahirna
Published: (2019)

On the zero forcing number of graphs and their splitting graphs
by: Chacko, Baby, et al.
Published: (2019)

The upper edge-to-vertex detour number of a graph
by: Santhakumaran, A.P., et al.
Published: (2012)

The upper edge-to-vertex detour number of a graph
by: Santhakumaran, A. P., et al.
Published: (2018)

The upper edge-to-vertex detour number of a graph
by: A. P. Santhakumaran, et al.
Published: (2012)

Method of managing the execution of tasks of a multithreaded program according to a given dependency graph
by: Terentiev, R.V., et al.
Published: (2024)

Method of managing the execution of tasks of a multithreaded program according to a given dependency graph
by: Nesterenko, K.P., et al.
Published: (2024)

Chromaticity and Color Filters for Fresnel Microprism.
by: Antonov, E. E.
Published: (2019)

Chromaticity and Color Filters for Fresnel Microprism
by: Ye. Ye. Antonov
Published: (2019)

Selection of the subgraphs of some types from the given graph
by: Khomenko, N. P., et al.
Published: (1966)

Existence of Pareto-optimal solutions to the vector optimization problem with an unbounded feasible set
by: T. I. Serhiienko
Published: (2015)

Some results of searching three or four active balls on a given set
by: H. P. Donets, et al.
Published: (2017)

Graphs with large Steiner number
by: J. John, et al.
Published: (2024)

Graphs with large Steiner number
by: John, J., et al.
Published: (2024)

On the principles of counting the number of graphs
by: Yurtsun, A. E., et al.
Published: (1966)

Diffraction Grating for Reducing Chromatism Area of Microprism
by: Antonov, E. E.
Published: (2014)

Proximinal sets and connectedness in graphs
by: K. Chaira, et al.
Published: (2023)

New fast methods to compute the number of primes less than a given value
by: G. R.P. Teruel
Published: (2022)

New fast methods to compute the number of primes less than a given value
by: Teruel, G. R. P., et al.
Published: (2022)