Oriented coloring of msp-digraphs and oriented co-graphs (extended abstract)

DOI10.1007/978-3-030-64843-5_50OpenAlexW3113174659MaRDI QIDQ2692252

Marvin Lindemann, Dominique Komander, Frank Gurski

Publication date: 21 March 2023

Full work available at URL: https://doi.org/10.1007/978-3-030-64843-5_50

zbMATH Keywords

linear time algorithmsoriented coloringoriented co-graphsmsp-digraphs

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (3)

The knapsack problem with special neighbor constraints ⋮ Homomorphisms to digraphs with large girth and oriented colorings of minimal series-parallel digraphs ⋮ Efficient computation of the oriented chromatic number of recursively defined digraphs

This page was built for publication: Oriented coloring of msp-digraphs and oriented co-graphs (extended abstract)