Abstract
Abstract
Authors
Institutions
No ROR-resolved institution is linked to this work yet.
Provenance
crossref
Confidence 100%
unpaywall
Confidence 95%
datacite
Confidence 0%
No local reference links have been materialized yet.
No local citing links have been materialized yet.
The use of graph theory in binary block code construction”
Kept as external metadata until matched
Eigenvalues and expanders”
10.1007/bf02579166
The Laplacian matrix of a graph”
Kept as external metadata until matched
On the Laplacian spectra of product graphs”
10.2298/aadm150218006b
Laplacian eigenmaps for dimensionality reduction and data representation”
10.1162/089976603321780317
10.1007/978-1-4614-1939-6
10.1007/978-1-4614-1939-6
Unresolved referenced work
Kept as external metadata until matched
Singular value decompositions of complex symmetric matrices&
10.1016/0377-0427(88)90386-x
The electrical resistance of a graph captures its commute and cover times
10.1007/bf01270385
Spectrum of the 1-Laplacian and Cheeger’s constant on graphs”
10.1002/jgt.21871
Unresolved referenced work
Kept as external metadata until matched
Unresolved referenced work
Kept as external metadata until matched
Unresolved referenced work
Kept as external metadata until matched
Unresolved referenced work
Kept as external metadata until matched
Laplacians and the Cheeger inequality for directed graphs”
10.1007/s00026-005-0237-z
Four proofs for the Cheeger inequality and graph partition algorithms”
Kept as external metadata until matched
A combinatorial Laplacian with vertex weights”
10.1006/jcta.1996.0080
“Diffusion maps”
10.1016/j.acha.2006.04.006
Developments in the theory of graph spectra”
10.1080/03081088508817683
Unresolved referenced work
Kept as external metadata until matched
Unresolved referenced work
Kept as external metadata until matched
Unresolved referenced work
Kept as external metadata until matched
Clustering with multi-layer graphs: A spectral perspective
10.1109/tsp.2012.2212886
Kron reduction of graphs with applications to electrical networks”
Kept as external metadata until matched
Unresolved referenced work
Kept as external metadata until matched
Unresolved referenced work
Kept as external metadata until matched
Algebraic connectivity of graphs”
10.21136/cmj.1973.101168
Eigenvalues of Laplacians on a closed Riemannian manifold and its nets”
10.1090/s0002-9939-1995-1257106-5
On the shift operator, graph frequency, and optimal filtering in graph signal processing”.
10.1109/tsp.2017.2752689
10.1007/978-1-84996-290-2
10.1007/978-1-84996-290-2
Geometrical structure of Laplacian eigenfunctions”.
10.1137/120880173
New spectral methods for ratio cut partitioning and clustering”
10.1109/43.159993
Extraction of temporal network structures from graph-based signals”
10.1109/tsipn.2016.2530562
Relabelling vertices according to the network structure by minimizing the cyclic bandwidth sum”
Kept as external metadata until matched
;On the notion of balance of a signed graph.
Kept as external metadata until matched
Unresolved referenced work
Kept as external metadata until matched
Bounds for the least Laplacian eigenvalue of a signed graph”
10.1007/s10114-004-0437-9
Spectrum-preserving sparsification for visualization of big graphs”
10.1016/j.cag.2020.02.004
Data clustering: 50 years beyond K-means”
10.1016/j.patrec.2009.09.011
Unresolved referenced work
Kept as external metadata until matched
10.1109/iccv.1999.790354
10.1109/iccv.1999.790354 · doi-reference
A tutorial on spectral clustering”.
10.1007/s11222-007-9033-z · doi-reference
10.1017/cbo9781139839099
10.1017/cbo9781139839099 · doi-reference
10.1007/978-3-030-29349-9_5
10.1007/978-3-030-29349-9_5 · doi-reference
A simple min-cut algorithm”.
10.1145/263867.263872 · doi-reference
Vertex-frequency energy distributions”.
10.1109/lsp.2017.2764884 · doi-reference
10.1007/978-3-030-03574-7_11
10.1007/978-3-030-03574-7_11 · doi-reference
Vertex-frequency analysis: A way to localize graph spectral components [Lecture Notes]”.
10.1109/msp.2017.2696572 · doi-reference
Understanding the basis of graph signal processing via an intuitive example-driven approach”
10.1109/msp.2019.2929832 · doi-reference
Spectral partitioning works: Planar graphs and finite element meshes”.
10.1016/j.laa.2006.07.020 · doi-reference
Graph sparsification by effective resistances”
10.1137/080734029 · doi-reference
The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains”.
10.1109/msp.2012.2235192 · doi-reference
Graph clustering”.
10.1016/j.cosrev.2007.05.001 · doi-reference
On the graph Fourier transform for directed graphs”.
10.1109/jstsp.2017.2726979 · doi-reference
Discrete signal processing on graphs: Frequency analysis”
10.1109/tsp.2014.2321121 · doi-reference
;Big data analysis with signal processing on graphs: Representation and processing of massive data sets with irregular structure”
10.1109/msp.2014.2329213 · doi-reference
Discrete signal processing on graphs”.
10.1109/tsp.2013.2238935 · doi-reference
Complex network measures of brain connectivity: Uses and interpretations”.
10.1016/j.neuroimage.2009.10.003 · doi-reference
Reduced interference vertex-frequency distributions”.
10.1109/lsp.2018.2860250 · doi-reference
;Clustering and embedding using commute times”
10.1109/tpami.2007.1103 · doi-reference
Eigenvectors of random matrices: A survey”
10.1016/j.jcta.2016.06.008 · doi-reference
10.1016/b978-0-12-813677-5.00008-0
10.1016/b978-0-12-813677-5.00008-0 · doi-reference
“Graph theory for image analysis: An approach based on the shortest spanning tree”
10.1049/ip-f-1.1986.0025 · doi-reference
Isoperimetric numbers of graphs”
10.1016/0095-8956(89)90029-4 · doi-reference
Spectral-based mesh segmentation”
10.1007/s12008-016-0300-0 · doi-reference
UMAP: Uniform manifold approximation and projection
10.21105/joss.00861 · doi-reference
A spectral graph wavelet approach for nonrigid 3D shape retrieval
10.1016/j.patrec.2016.04.009 · doi-reference
Spectral shape classification: A deep learning approach
10.1016/j.jvcir.2017.01.001 · doi-reference
Contour and texture analysis for image segmentation
10.1023/a:1011174803800 · doi-reference
Some properties of Cartesian product graphs of Cayley graphs with arithmetic graphs
10.5120/ijca2016908742 · doi-reference
Non-negative and sparse spectral clustering
10.1016/j.patcog.2013.07.003 · doi-reference
10.1017/cbo9781139523967
10.1017/cbo9781139523967 · doi-reference
10.1007/978-94-011-5014-9
10.1007/978-94-011-5014-9 · doi-reference