Coloring the nodes of a directed graph

DOI10.2478/ausi-2014-0021zbMath1297.05092OpenAlexW1965626709MaRDI QIDQ399510

Sándor Szabó, Bogdán Zaválnij

Publication date: 19 August 2014

Published in: Acta Universitatis Sapientiae. Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2478/ausi-2014-0021

zbMATH Keywords

graph coloringtournamentNP-hard problemstransitive tournamentcoloring the nodesmaximum transitive tournamentsimple directed graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Directed graphs (digraphs), tournaments (05C20)

Uses Software

• MaxCliqueDyn

Cites Work

• An exact algorithm for the maximum clique problem
• A fast algorithm for the maximum clique problem
• The Voting Problem
• On Sets of Consistent Arcs in a Tournament
• Algorithms for finding maximum transitive subtournaments
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Coloring the nodes of a directed graph