Constructive algorithms for the partial directed weighted improper coloring problem

DOI10.7155/jgaa.00389zbMath1331.05208OpenAlexW2296267519MaRDI QIDQ2790161

Romain Montagné, François Gagnon, Alain Hertz

Publication date: 3 March 2016

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00389

zbMATH Keywords

order of the largest induced subgraph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Signed and weighted graphs (05C22)

Related Items (3)

Online algorithms for the maximum \(k\)-colorable subgraph problem ⋮ The Maximum k-Colorable Subgraph Problem and Related Problems ⋮ A comparison of integer programming models for the partial directed weighted improper coloring problem

This page was built for publication: Constructive algorithms for the partial directed weighted improper coloring problem