Clustering on k-Edge-Colored graphs | Sciact - Система учета научной деятельности ИМ СО РАН

Clustering on k-Edge-Colored graphs Научная публикация

Журнал

Discrete Applied Mathematics
ISSN: 0166-218X

Вых. Данные

Год: 2016, Том: 211, Страницы: 15-22 Страниц : 8 DOI: 10.1016/j.dam.2016.04.017

Ключевые слова

Approximation algorithms; Clustering; Coloring

Авторы

Angel E. ¹ , Bampis E. ² , Kononov A. ³ , Paparas D. ⁴ , Pountourakis E. ⁵ , Zissimopoulos V. ⁶

Организации

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

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

Web of science:	WOS:000380082400002
Scopus:	2-s2.0-84966559629
OpenAlex:	W2350862829

БД	Цитирований
Scopus	11
OpenAlex	7
Web of science	8