Constructive algorithms for the partial directed weighted improper coloring problem
Work
Year: 2016
Type: article
Abstract: Given a complete directed graph G with weights on the vertices and on the arcs, a θ-improper k-coloring is an assignment of at most k different colors to the vertices of G such that the weight of ever... more
Institutions Polytechnique Montréal, École de Technologie Supérieure
Cites: 19
Cited by: 4
Related to: 10
FWCI: 0.242
Citation percentile (by year/subfield): 58.91
Subfield: Electrical and Electronic Engineering
Field: Engineering
Domain: Physical Sciences
Open Access status: diamond