Clustering on k-Edge-Colored Graphs

Clustering on k-Edge-Colored Graphs Full article

Conference

International Symposium on Mathematical Foundations of Computer Science
26-30 Aug 2013 , Klosterneuburg, Austria

Source

Mathematical Foundations of Computer Science 2013. MFCS 2013. Lecture Notes in Computer Science
Compilation, Springer-Verlag,. Berlin, Heidelberg.2013. 869 c. ISBN 9783642403125.

Output data

Year: 2013, Volume: 8087, Pages: 50-61 Pages count : 12 DOI: 10.1007/978-3-642-40313-2_7

Authors

Angel Eric ¹ , Bampis Evripidis ² , Kononov Alexander ³ , Paparas Dimitris ⁴ , Pountourakis Emmanouil ⁵ , Zissimopoulos Vassilis ⁶

Affiliations

1	IBISC, Universit´e d’Evry, France
2	Laboratoire de Recherche en Informatique de Paris 6
3	Sobolev Institute of Mathematics
4	Columbia University
5	Northwestern University
6	National and Kapodistrian University of Athens

Angel E. , Bampis E. , Kononov A. , Paparas D. , Pountourakis E. , Zissimopoulos V.
Clustering on k-Edge-Colored Graphs
In compilation Mathematical Foundations of Computer Science 2013. MFCS 2013. Lecture Notes in Computer Science. – Springer-Verlag,., 2013. – Т.8087. – C.50-61. – ISBN 9783642403125. DOI: 10.1007/978-3-642-40313-2_7 OpenAlex

OpenAlex:

W2122131518

DB	Citing
OpenAlex	6