Pages that link to "Item:Q2136276"
From MaRDI portal
The following pages link to Graph clustering via generalized colorings (Q2136276):
Displaying 8 items.
- Clustering on \(k\)-edge-colored graphs (Q335326) (← links)
- Clique clustering yields a PTAS for max-coloring interval graphs (Q722535) (← links)
- Clustering as a dual problem to colouring (Q2140780) (← links)
- Clustering on k-Edge-Colored Graphs (Q2849897) (← links)
- Clique Clustering Yields a PTAS for max-Coloring Interval Graphs (Q3012804) (← links)
- Цветовая энергия некоторых кластерных графов (Q5044027) (← links)
- ON GENERIC COMPLEXITY OF THE GRAPH CLUSTERING PROBLEM (Q5151290) (← links)
- Graph clustering via generalized colorings (Q6362827) (← links)