Undirected Graphs: Is the Shift-Enabled Condition Trivial or Necessary?
With the growing application of undirected graphs for signal/image processing on graphs and distributed machine learning, we demonstrate that the shift-enabled condition is as necessary for undirected graphs as it is for directed graphs. It has recently been shown that, contrary to the widespread be...
Main Authors: | Liyan Chen, Samuel Cheng, Kanghang He, Vladimir Stankovic, Lina Stankovic |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2021-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9427536/ |
Similar Items
-
On categoricity questions for universal unars and undirected graphs under semantic Jonsson quasivariety
by: A.R. Yeshkeyev, et al.
Published: (2023-09-01) -
On the Solvability of the Discrete <i>s</i>(<i>x</i>,·)-Laplacian Problems on Simple, Connected, Undirected, Weighted, and Finite Graphs
by: Filip Pietrusiak, et al.
Published: (2022-09-01) -
Efficient Maintenance of Minimum Spanning Trees in Dynamic Weighted Undirected Graphs
by: Mao Luo, et al.
Published: (2024-03-01) -
Building a Graph Signal Processing Model Using Dynamic Time Warping for Load Disaggregation
by: Kanghang He, et al.
Published: (2020-11-01) -
Graph-Based EEG Signal Compression for Human–Machine Interaction
by: Takuya Fujihashi, et al.
Published: (2024-01-01)