Bounded max-colorings of graphs | Sciact

Bounded max-colorings of graphs Full article

Journal

Journal of Discrete Algorithms
ISSN: 1570-8667

Output data

Year: 2014, Volume: 26, Pages: 56-68 Pages count : 13 DOI: 10.1016/j.jda.2013.11.003

Tags

Approximation algorithms; Bounded coloring; Complexity; Max-coloring

Authors

Bampis E. ¹ , Kononov A. ² , Lucarelli G. ¹ , Milis I. ³

Affiliations

1	LIP6, Université Pierreet Marie Curie, France
2	bSobolevInstituteofMathematics,prKoptyuga4,Novosibirsk,Russia
3	Dept .of Informatics, Athens University of Economics and Business, Greece

Bampis E. , Kononov A. , Lucarelli G. , Milis I.
Bounded max-colorings of graphs
Journal of Discrete Algorithms. 2014. V.26. P.56-68. DOI: 10.1016/j.jda.2013.11.003 Scopus OpenAlex

Submitted:	Apr 26, 2012
Accepted:	Nov 19, 2013
Published online:	Nov 25, 2013

Scopus:	2-s2.0-84899628802
OpenAlex:	W2023853306

DB	Citing
Scopus	3
OpenAlex	3