🚀 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
🚀Our WSDM'25 paper introduces a new edge-based framework for decomposing temporal networks.
⚡️Scales to 100M+ edges, reveals structures in dynamic data—eg, misinformation patterns on Twitter
📄 arxiv.org/abs/2309.11843
With A.Konstantinidis & G.Italiano
#temporalgraphs #graphmining #misinformation
⚡️Scales to 100M+ edges, reveals structures in dynamic data—eg, misinformation patterns on Twitter
📄 arxiv.org/abs/2309.11843
With A.Konstantinidis & G.Italiano
#temporalgraphs #graphmining #misinformation
An Edge-Based Decomposition Framework for Temporal Networks
A temporal network is a dynamic graph where every edge is assigned an integer time label that indicates at which discrete time step the edge is available. We consider the problem of hierarchically dec...
arxiv.org
July 12, 2025 at 3:50 AM
🚀Our WSDM'25 paper introduces a new edge-based framework for decomposing temporal networks.
⚡️Scales to 100M+ edges, reveals structures in dynamic data—eg, misinformation patterns on Twitter
📄 arxiv.org/abs/2309.11843
With A.Konstantinidis & G.Italiano
#temporalgraphs #graphmining #misinformation
⚡️Scales to 100M+ edges, reveals structures in dynamic data—eg, misinformation patterns on Twitter
📄 arxiv.org/abs/2309.11843
With A.Konstantinidis & G.Italiano
#temporalgraphs #graphmining #misinformation
A new study presented at the 2025 IEEE IPDPS in Milan shows work-avoidance techniques can speed maximum clique search by up to 38.9× over the PMC algorithm and 11× over MC-BRB. https://getnews.me/new-work-avoidance-techniques-accelerate-maximum-clique-search/ #maximumclique #graphmining #ieeeipdps
September 29, 2025 at 1:06 PM
A new study presented at the 2025 IEEE IPDPS in Milan shows work-avoidance techniques can speed maximum clique search by up to 38.9× over the PMC algorithm and 11× over MC-BRB. https://getnews.me/new-work-avoidance-techniques-accelerate-maximum-clique-search/ #maximumclique #graphmining #ieeeipdps