Fetching the paper…
Reading the bibliography…
The area of Data Analytics on graphs promises a paradigm shift as we approach information processing of classes of data, which are typically acquired on irregular but structured domains (social networks, various ad-hoc sensor networks).
G. Kron, Diakoptics: the piecewise solution of large-scale systems, Vol. 2, MacDonald, 1963
1963
Earlier work this paper cites.
M. Fiedler, Algebraic connectivity of graphs, Czechoslovak mathematical journal 23 (2) (1973) 298–305
1973
Earlier work this paper cites.
N. Christofides, Graph theory: An algorithmic approach, Academic Press, 1975
1975
Earlier work this paper cites.
F. Afrati, A. G. Constantinides, The use of graph theory in binary block code construction, in: Proceedings of the International Conference on Digital Signal Processing, 1978, pp. 228–233
1978
Earlier work this paper cites.
D. M. Cvetković, M. Doob, H. Sachs, Spectra of graphs: Theory and application, Vol. 87, Academic Press, 1980
1980
Earlier work this paper cites.
D. M. Cvetković, M. Doob, Developments in the theory of graph spectra, Linear and Multilinear Algebra 18 (2) (1985) 153–181
1985
Earlier work this paper cites.
O. J. Morris, M. d. J. Lee, A. G. Constantinides, Graph theory for image analysis: An approach based on the shortest spanning tree, IEE Proceedings F-Communications, Radar and Signal Processing 133 (2) (1986) 146–152
1986
Earlier work this paper cites.
O. Morris, M. d. J. Lee, A. Constantinides, Graph theory for image analysis: An approach based on the shortest spanning tree, IEE Proceedings F (Communications, Radar and Signal Processing) 133 (2) (1986) 146–152
1986
Earlier work this paper cites.
A. Bunse-Gerstner, W. B. Gragg, Singular value decompositions of complex symmetric matrices, Journal of Computational and Applied Mathematics 21 (1) (1988) 41–54
1988
Earlier work this paper cites.
B. Mohar, Isoperimetric numbers of graphs, Journal of combinatorial theory, Series B 47 (3) (1989) 274–291
1989
Earlier work this paper cites.
G. L. Scott, H. C. Longuet-Higgins, Feature grouping by relocalisation of eigenvectors of the proximity matrix., in: Proc. of the British Machine Vision Conference (BMVC), 1990, pp. 1–6
1990
Earlier work this paper cites.
L. Hagen, A. B. Kahng, New spectral methods for ratio cut partitioning and clustering, IEEE transactions on computer-aided design of integrated circuits and systems 11 (9) (1992) 1074–1085
1992
Earlier work this paper cites.
K. Fujiwara, Eigenvalues of Laplacians on a closed Riemannian manifold and its nets, Proceedings of the American Mathematical Society 123 (8) (1995) 2585–2594
1995
Earlier work this paper cites.
R. Bapat, The Laplacian matrix of a graph, Mathematics Student-India 65 (1) (1996) 214–223
1996
Earlier work this paper cites.
F. R. Chung, R. P. Langlands, A combinatorial laplacian with vertex weights, journal of combinatorial theory, Series A 75 (2) (1996) 316–327
1996
Earlier work this paper cites.
A. K. Chandra, P. Raghavan, W. L. Ruzzo, R. Smolensky, P. Tiwari, The electrical resistance of a graph captures its commute and cover times, Computational Complexity 6 (4) (1996) 312–340
1996
Earlier work this paper cites.
F. Chung, Spectral graph theory, AMS, Providence, RI, 1997
1997
Earlier work this paper cites.
M. Stoer, F. Wagner, A simple min-cut algorithm, Journal of the ACM (JACM) 44 (4) (1997) 585–591
1997
Earlier work this paper cites.
M. I. Jordan, Learning in graphical models, Vol. 89, Springer Science & Business Media, 1998
1998
Earlier work this paper cites.
S. Khuller, Approximation algorithms for finding highly connected subgraphs, Tech. rep. (1998)
1998
Earlier work this paper cites.
P. Perona, W. Freeman, A factorization approach to grouping, in: Prof. of European Conference on Computer Vision, Springer, 1998, pp. 655–670
1998
Earlier work this paper cites.
Y. Weiss, Segmentation using eigenvectors: A unifying view, in: Proceedings of the Seventh IEEE International Conference on Computer Vision, Vol. 2, IEEE, 1999, pp. 975–982
1999
Earlier work this paper cites.
J. Shi, J. Malik, Normalized cuts and image segmentation, Departmental Papers (CIS) (2000) 107
2000
Earlier work this paper cites.
J. Malik, S. Belongie, T. Leung, J. Shi, Contour and texture analysis for image segmentation, International Journal of Computer Vision 43 (1) (2001) 7–27
2001
Earlier work this paper cites.
A. Y. Ng, M. I. Jordan, Y. Weiss, On spectral clustering: Analysis and an algorithm, in: Proc. Advances in Neural Information Processing Systems, 2002, pp. 849–856
2002
Earlier work this paper cites.
E. R. Van Dam, W. H. Haemers, Which graphs are determined by their spectrum?, Linear Algebra and Its Applications 373 (2003) 241–272
2003
Earlier work this paper cites.
M. Belkin, P. Niyogi, Laplacian eigenmaps for dimensionality reduction and data representation, Neural Computation 15 (6) (2003) 1373–1396
2003
Cited alongside, same era.
Z. Wang, E. P. Simoncelli, A. C. Bovik, Multiscale structural similarity for image quality assessment, in: Proc. of The Thrity-Seventh Asilomar Conference on Signals, Systems & Computers, 2003, Vol. 2, 2003, pp. 1398–1402
2003
Cited alongside, same era.
M. I. Jordan, et al., Graphical models, Statistical Science 19 (1) (2004) 140–155
2004
Cited alongside, same era.
A. Duncan, Powers of the adjacency matrix and the walk matrix, The Collection (2004) 1–11
2004
Cited alongside, same era.
I. S. Dhillon, Y. Guan, B. Kulis, Kernel k-means: Spectral clustering and normalized cuts, in: Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, 2004, pp. 551–556
O. Jones, Spectra of simple graphs[Online]. Available: https://www.whitman.edu/Documents/Academics /Mathematics/Jones.pdf, Whitman College, 2013
2013
Later among the works it cites.
L. Trevisan, Lecture notes on expansion, sparsest cut, and spectral graph theory (2013)
2013
Later among the works it cites.
M. Vetterli, J. Kovačević, V. Goyal, Foundations of signal processing, Cambridge University Press., 2014
2014
Later among the works it cites.
V. N. Ekambaram, Graph-structured data viewed through a Fourier lens, University of California, Berkeley, 2014
2014
Later among the works it cites.
A. Sandryhaila, J. M. Moura, Discrete signal processing on graphs: Frequency analysis, IEEE Transactions on Signal Processing 62 (12) (2014) 3042–3054
2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2004
Cited alongside, same era.
F. Chung, Laplacians and the cheeger inequality for directed graphs, Annals of Combinatorics 9 (1) (2005) 1–19
2005
Cited alongside, same era.
J. Kleinberg, E. Tardos, Algorithm design, Pearson Education India, 2006
2006
Cited alongside, same era.
R. R. Coifman, S. Lafon, Diffusion maps, Applied and computational harmonic analysis 21 (1) (2006) 5–30
2006
Cited alongside, same era.
J. Leskovec, C. Faloutsos, Sampling from large graphs, in: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, 2006, pp. 631–636
2006
Cited alongside, same era.
S. E. Schaeffer, Graph clustering, Computer Science Review 1 (1) (2007) 27–64
2007
Cited alongside, same era.
D. A. Spielman, S.-H. Teng, Spectral partitioning works: Planar graphs and finite element meshes, Linear Algebra and its Applications 421 (2-3) (2007) 284–305
2007
Cited alongside, same era.
H. Qiu, E. R. Hancock, Clustering and embedding using commute times, IEEE Transactions on Pattern Analysis and Machine Intelligence 29 (11) (2007) 1873–1890
2007
Cited alongside, same era.
A. Sandryhaila, J. M. Moura, Big data analysis with signal processing on graphs: Representation and processing of massive data sets with irregular structure, IEEE Signal Processing Magazine 31 (5) (2014) 80–90
2014
Later among the works it cites.
S. Chen, A. Sandryhaila, J. M. Moura, J. Kovačević, Signal denoising on graphs via graph filtering, in: Proc. 2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP), 2014, pp. 872–876
2014
Later among the works it cites.
H. Lu, Z. Fu, X. Shu, Non-negative and sparse spectral clustering, Pattern Recognition 47 (1) (2014) 418–426
2014
Later among the works it cites.
H. Krim, A. B. Hamza, Geometric methods in signal and image analysis, Cambridge University Press, 2015
2015
Later among the works it cites.
S. O’Rourke, V. Vu, K. Wang, Eigenvectors of random matrices: A survey, Journal of Combinatorial Theory, Series A 144 (2016) 361–442
2016
Later among the works it cites.
S. U. Maheswari, B. Maheswari, Some properties of Cartesian product graphs of Cayley graphs with arithmetic graphs, International Journal of Computer Applications 138 (3) (2016) 26–29
2016
Later among the works it cites.
R. Hamon, P. Borgnat, P. Flandrin, C. Robardet, Extraction of temporal network structures from graph-based signals, IEEE Transactions on Signal and Information Processing over Networks 2 (2) (2016) 215–226
2016
Later among the works it cites.
R. Hamon, P. Borgnat, P. Flandrin, C. Robardet, Relabelling vertices according to the network structure by minimizing the cyclic bandwidth sum, Journal of Complex Networks 4 (4) (2016) 534–560
2016
Later among the works it cites.
M. Masoumi, C. Li, A. B. Hamza, A spectral graph wavelet approach for nonrigid 3D shape retrieval, Pattern Recognition Letters 83 (2016) 339–348
2016
Later among the works it cites.
A. Marques, A. Ribeiro, S. Segarra, Graph signal processing: Fundamentals and applications to diffusion processes, in: Proc. Int. Conf. Accoustic, Speech and Signal Processing, (ICASSP), 2017, IEEE, 2017
2017
Later among the works it cites.
A. Gavili, X.-P. Zhang, On the shift operator, graph frequency, and optimal filtering in graph signal processing, IEEE Transactions on Signal Processing 65 (23) (2017) 6303–6318
2017
Later among the works it cites.
D. Mejia, O. Ruiz-Salguero, C. A. Cadavid, Spectral-based mesh segmentation, International Journal on Interactive Design and Manufacturing (IJIDeM) 11 (3) (2017) 503–514
2017
Later among the works it cites.
M. Masoumi, A. B. Hamza, Spectral shape classification: A deep learning approach, Journal of Visual Communication and Image Representation 43 (2017) 198–211
2017
Later among the works it cites.
L. Stanković, M. Daković, E. Sejdić, Vertex-frequency analysis: A way to localize graph spectral components [lecture notes], IEEE Signal Processing Magazine 34 (4) (2017) 176–182
2017
Later among the works it cites.
M. Mijalkov, E. Kakaei, J. B. Pereira, E. Westman, G. Volpe, BRAPH: A graph theory software for the analysis of brain connectivity, PLOS ONE 12.8 (2017): e0178798 doi:https://doi.org/10.1371/journal.pone.0178798
2017
Later among the works it cites.
J. M. Moura, Graph signal processing, in: Cooperative and Graph Signal Processing, P. Djuric and C. Richard, Editors, Elsevier, 2018, pp. 239–259
2018
Later among the works it cites.
S. Saito, D. P. Mandic, H. Suzuki, Hypergraph p-Laplacian: A differential geometry view, in: Thirty-Second AAAI Conference on Artificial Intelligence, 2018
2018
Later among the works it cites.
2018
Later among the works it cites.
L. Stanković, M. Daković, E. Sejdić, Vertex-frequency energy distributions, in: Vertex-Frequency Analysis of Graph Signals, Springer, 2019, pp. 377–415
2019
Closest in time.
L. Stankovic, D. Mandic, M. Dakovic, I. Kisil, E. Sejdic, A. G. Constantinides, Understanding the basis of graph signal processing via an intuitive example-driven approach, IEEE Signal Processing Magazine (2019) submitted
2019
Closest in time.