Jun 27, 2019 · To identify critical connections, we propose a novel problem, named k-truss minimization. Given a social network G and a budget b, it aims to ...

Jun 27, 2019 · To identify the critical edges, we propose two novel problems named k-truss minimization problem and k-truss maximization problem. Given a ...

This paper proposes a novel problem, named k-truss minimization, given a social network G and a budget b, which aims to find b edges for deletion which can ...

To identify critical connections, we propose a novel problem, named k-truss minimization. Given a social network G and a budget b, it aims to find b edges for ...

Oct 19, 2020 · To better describe the communities, we propose a novel model, named signed k-truss, which leverages the properties of k-truss and balanced ...

In this paper, we use the k-truss model to measure the stability of a social network. To identify critical connections, we propose a novel problem, named k- ...

We introduce a novel equivalence relation, k-truss equivalence, to model the intrinsic density and co- hesiveness of edges in k-truss communities.

In this paper, we leverage the k-truss model to measure the stability of a social network. To identify the critical edges, we propose two novel problems ...

A k-truss is a graph such that each edge is contained in at least. k − 2 triangles. This notion has attracted much attention, because it models meaningful ...

Critical Edge Identification: A K-Truss Based Model · Wenjie Zhu, Mengqi Zhang, Chen Chen, Xiaoyang Wang, Fan Zhang, Xuemin Lin · CoRR 2019 ; K-Core Maximization ...