🚀 In our WebConf’24 paper, we tackle a new twist on densest subgraphs: finding diverse communities via edge-color constraints! 🌈🔍
We prove hardness and give a fast approximation for large sparse graphs. 📈
With H. Wang & A. Gionis
arxiv.org/abs/2402.09124
#WebConf24 #GraphMining #Diversity
We prove hardness and give a fast approximation for large sparse graphs. 📈
With H. Wang & A. Gionis
arxiv.org/abs/2402.09124
#WebConf24 #GraphMining #Diversity
Finding Densest Subgraphs with Edge-Color Constraints
We consider a variant of the densest subgraph problem in networks with single or multiple edge attributes. For example, in a social network, the edge attributes may describe the type of relationship b...
arxiv.org
July 12, 2025 at 4:14 AM
🚀 In our WebConf’24 paper, we tackle a new twist on densest subgraphs: finding diverse communities via edge-color constraints! 🌈🔍
We prove hardness and give a fast approximation for large sparse graphs. 📈
With H. Wang & A. Gionis
arxiv.org/abs/2402.09124
#WebConf24 #GraphMining #Diversity
We prove hardness and give a fast approximation for large sparse graphs. 📈
With H. Wang & A. Gionis
arxiv.org/abs/2402.09124
#WebConf24 #GraphMining #Diversity