F&F watermarks unweighted graphs by inserting a Gaussian key into Fourier coefficients of the adjacency matrix and binarizing the result, achieving O(N^2 log N) embedding and extraction with robustness to random edge flips.
Special issue on big graph data management and processing
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Fast In-Spectrum Graph Watermarks
F&F watermarks unweighted graphs by inserting a Gaussian key into Fourier coefficients of the adjacency matrix and binarizing the result, achieving O(N^2 log N) embedding and extraction with robustness to random edge flips.