Edge weights are transformed as a graph signal on the line graph and coded with graph filter banks, giving better rate-distortion than direct matrix preprocessing while preserving topology.
Eigen- decomposition Free Sampling Set Selection for Graph Signal s
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Lossy compression of weighted graph adjacency matrices by transform coding
Edge weights are transformed as a graph signal on the line graph and coded with graph filter banks, giving better rate-distortion than direct matrix preprocessing while preserving topology.