
Exploiting 𝐜Closure in Kernelization Algorithms for Graph Problems
A graph is cclosed if every pair of vertices with at least c common nei...
read it

Detecting and Enumerating Small Induced Subgraphs in cClosed Graphs
Fox et al. [SIAM J. Comp. 2020] introduced a new parameter, called cclo...
read it

FPT Algorithms for Finding Dense Subgraphs in cClosed Graphs
Dense subgraph detection is a fundamental problem in network analysis fo...
read it

Anisotropic Radial Layout for Visualizing Centrality and Structure in Graphs
This paper presents a novel method for layout of undirected graphs, wher...
read it

Relaxing Common Belief for Social Networks
We propose a relaxation of common belief called factional belief that is...
read it

Evolutionary Centrality and Maximal Cliques in Mobile Social Networks
This paper introduces an evolutionary approach to enhance the process of...
read it

A Simply Study to Steganography on Social Networks
Steganography aims to conceal the very fact that the communication takes...
read it
Finding Cliques in Social Networks: A New DistributionFree Model
We propose a new distributionfree model of social networks. Our definitions are motivated by one of the most universal signatures of social networks, triadic closurethe property that pairs of vertices with common neighbors tend to be adjacent. Our most basic definition is that of a "cclosed" graph, where for every pair of vertices u,v with at least c common neighbors, u and v are adjacent. We study the classic problem of enumerating all maximal cliques, an important task in social network analysis. We prove that this problem is fixedparameter tractable with respect to c on cclosed graphs. Our results carry over to "weakly cclosed graphs", which only require a vertex deletion ordering that avoids pairs of nonadjacent vertices with c common neighbors. Numerical experiments show that wellstudied social networks tend to be weakly cclosed for modest values of c.
READ FULL TEXT
Comments
There are no comments yet.