A New Greedy Algorithm for Improving b-Coloring Clustering

DOI10.1007/978-3-540-72903-7_21zbMath1182.68166OpenAlexW1645048849MaRDI QIDQ5325737

Véronique Deslandres, M.-S. Hacid, Tetsuya Yoshida, Alain Dussauchoy, Haytham Elghazel

Publication date: 24 July 2009

Published in: Graph-Based Representations in Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72903-7_21

zbMATH Keywords

clusteringgraph b-coloringgraph re-coloring

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10) Pattern recognition, speech recognition (68T10) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

\(b\)-chromatic sum of Mycielskian of paths

This page was built for publication: A New Greedy Algorithm for Improving b-Coloring Clustering