Sciact
  • EN
  • RU

Clustering on k-Edge-Colored graphs Full article

Journal Discrete Applied Mathematics
ISSN: 0166-218X
Output data Year: 2016, Volume: 211, Pages: 15-22 Pages count : 8 DOI: 10.1016/j.dam.2016.04.017
Tags Approximation algorithms; Clustering; Coloring
Authors Angel E. 1 , Bampis E. 2 , Kononov A. 3 , Paparas D. 4 , Pountourakis E. 5 , Zissimopoulos V. 6
Affiliations
1 IBISC, Universit´e d’Evry, France
2 Sorbonne Universit´es, UPMC Univ Paris 06, UMR 7606, LIP6, F-75005, Paris, France
3 Sobolev Institute of Mathematics, Novosibirsk, Russia
4 Computer Science department, Columbia University, USA
5 EECS department, Northwestern University, USA
6 Department of Informatics & Telecommunications, National and Kapodistrian University of Athens, Greece
Cite: Angel E. , Bampis E. , Kononov A. , Paparas D. , Pountourakis E. , Zissimopoulos V.
Clustering on k-Edge-Colored graphs
Discrete Applied Mathematics. 2016. V.211. P.15-22. DOI: 10.1016/j.dam.2016.04.017 WOS Scopus OpenAlex
Identifiers:
Web of science: WOS:000380082400002
Scopus: 2-s2.0-84966559629
OpenAlex: W2350862829
Citing:
DB Citing
Scopus 11
OpenAlex 7
Web of science 8
Altmetrics: