1 citations · 3 across the 19 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
cs.SI2024
Consistent Tie-Strength Labeling for Multilayer Strong Triadic Closure
Lutz Oettershagen, Athanasios L. Konstantinidis, Fariba Ranjbar +1
Inferring tie strengths (strong vs. weak) is a core task in network analysis, often guided by the Strong Triadic Closure (STC) principle. In multilayer networks, such as social pla…
cs.SI2024
Finding Densest Subgraphs with Edge-Color Constraints
Lutz Oettershagen, Honglian Wang, Aristides Gionis
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 ty…