Complex Network Filtering and Compression Algorithm Based on Triangle-Subgraph
Compressing the data of a complex network is important for visualization. Based on the triangle-subgraph structure in complex networks, complex network filtering compression algorithm based on the triangle-subgraph is proposed. The algorithm starts from the edge, lists nodes of the edge and their co...
Saved in:
Main Authors: | Shuxia Ren, Tao Wu, Shubo Zhang |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2020-01-01
|
Series: | Discrete Dynamics in Nature and Society |
Online Access: | http://dx.doi.org/10.1155/2020/7498605 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
On the Distributions of Subgraph Centralities in Complex Networks
by: Faxu Li, et al.
Published: (2013-01-01) -
Subgraph-Indexed Sequential Subdivision for Continuous Subgraph Matching on Dynamic Knowledge Graph
by: Yunhao Sun, et al.
Published: (2020-01-01) -
Metrics for Multiset-Theoretic Subgraphs
by: Ray-Ming Chen
Published: (2019-01-01) -
On forbidden subgraphs of main supergraphs of groups
by: Xiaoyan Xu, et al.
Published: (2024-08-01) -
Twin Subgraphs and Core-Semiperiphery-Periphery Structures
by: Ricardo Riaza
Published: (2018-01-01)