Latent Network Features and Overlapping Community Discovery via Boolean Intersection Representations [0.03%]
基于布尔交集表示的潜在网络特征及重叠社区发现
Hoang Dau,Olgica Milenkovic
Hoang Dau
We propose a new latent Boolean feature model for complex networks that captures different types of node interactions and network communities. The model is based on a new concept in graph theory, termed the Boolean intersection representati...
Ioannis Ch Paschalidis,Fuzhuo Huang,Wei Lai
Ioannis Ch Paschalidis
We consider scheduling in wireless networks and formulate it as Maximum Weighted Independent Set (MWIS) problem on a "conflict" graph that captures interference among simultaneous transmissions. We propose a novel, low-complexity, and fully...