volume 6, issue 1, P117-131 2014
DOI: 10.2478/ausi-2014-0021
View full text
|
|
Share

Abstract: Abstract It is an empirical fact that coloring the nodes of a graph can be used to speed up clique search algorithms. In directed graphs transitive subtournaments can play the role of cliques. In order to speed up algorithms to locate large transitive tournaments we propose a scheme for coloring the nodes of a directed graph. The main result of the paper is that in practically interesting situations determining the optimal number of colors in the proposed coloring is an NP-hard problem. A possible conclus…

expand abstract