Open AccessNP-Completeness and One Polynomial Subclass of the Two-Step Graph Colouring Problem
Author(s) -
Natalya Sergeevna Medvedeva,
А. В. Смирнов
Publication year - 2020
Publication title -
automatic control and computer sciences
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.299
H-Index - 17
eISSN - 1558-108X
pISSN - 0146-4116
DOI - 10.3103/s0146411620070159
Subject(s) - computer science , subclass , completeness (order theory) , graph , discrete mathematics , mathematics , combinatorics , theoretical computer science , medicine , mathematical analysis , antibody , immunology
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom