Pages that link to "Item:Q2849897"
From MaRDI portal
The following pages link to Clustering on k-Edge-Colored Graphs (Q2849897):
Displaying 9 items.
- Chromatic kernel and its applications (Q266072) (← links)
- Clustering on \(k\)-edge-colored graphs (Q335326) (← links)
- Maximum colorful cliques in vertex-colored graphs (Q1791008) (← links)
- Clustering as a dual problem to colouring (Q2140780) (← links)
- On the complexity of edge-colored subgraph partitioning problems in network optimization (Q2816508) (← links)
- Improved Approximations for the Max k-Colored Clustering Problem (Q3453278) (← links)
- A 0.3622-Approximation Algorithm for the Maximum k-Edge-Colored Clustering Problem (Q4965094) (← links)
- Clustering in Hypergraphs to Minimize Average Edge Service Time (Q5111753) (← links)
- Maximum cuts in edge-colored graphs (Q5918845) (← links)