Computation of Graph Fourier Transform Centrality Using Graph Filter
In this paper, the computation of graph Fourier transform centrality (GFTC) of complex network using graph filter is presented. For conventional computation method, it needs to use the non-sparse transform matrix of graph Fourier transform (GFT) to compute GFTC scores. To reduce the computational co...
Saved in:
Main Authors: | Chien-Cheng Tseng, Su-Ling Lee |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2024-01-01
|
Series: | IEEE Open Journal of Circuits and Systems |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/10500497/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Efficient State Estimation Through Rapid Topological Analysis Based on Spatiotemporal Graph Methodology
by: Zhen Dai, et al.
Published: (2024-01-01) -
On the Graph Isomorphism Completeness of Directed and Multidirected Graphs
by: Sebastian Pardo-Guerra, et al.
Published: (2025-01-01) -
An introduction of F-graphs, a graph-theoretic representation of natural numbers
by: E. J. Farrell
Published: (1992-01-01) -
Longest cycles in certain bipartite graphs
by: Pak-Ken Wong
Published: (1998-01-01) -
4-REGULAR GRAPH OF DIAMETER 2
by: Đỗ Như An, et al.
Published: (2013-06-01)