4 papers
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…
Efficient Hypergraph Pattern Matching via Match-and-Filter and Intersection Constraint
Siwoo Song, Wonseok Shin, Kunsoo Park +3
A hypergraph is a generalization of a graph, in which a hyperedge can connect multiple vertices, modeling complex relationships involving multiple vertices simultaneously. Hypergra…
Graph Traversal via Connected Mobile Agents
Saswata Jana, Giuseppe F. Italiano, Partha Sarathi Mandal
This paper considers the Hamiltonian walk problem in the multi-agent coordination framework, referred to as -agents Hamiltonian walk problem (-HWP). In this problem, a set of…
An Edge-Based Decomposition Framework for Temporal Networks
Lutz Oettershagen, Athanasios L. Konstantinidis, Giuseppe F. Italiano
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 o…