Hossein Maserrat

Learn More
Suppose we have a family F of sets. For every S ∈ F, a set D ⊆ S is a defining set for (F, S) if S is the only element of F that contains D as a subset. This concept has been studied in numerous cases, such as vertex colorings, perfect matchings, dominating sets, block designs, geodetics, orientations, and Latin squares. In this paper, first, we propose the(More)
Compression plays an important role in social network analysis from both practical and theoretical points of view. Although there are a few pioneering studies on social network compression, they mainly focus on lossless approaches. In this paper, we tackle the novel problem of community preserving lossy compression of social networks. The trade-off between(More)
  • 1