Reconstruction of Graph Signals Through Percolation from Seeding Nodes.
Santiago SegarraAntonio G. MarquesGeert LeusAlejandro RibeiroPublished in: IEEE Trans. Signal Process. (2016)
Keyphrases
- graph structure
- directed graph
- undirected graph
- small world
- adjacency matrix
- edge weights
- scale free
- signal reconstruction
- spanning tree
- weighted graph
- graph structures
- connected graphs
- random walk
- random graphs
- three dimensional
- graph theory
- fully connected
- strongly connected
- image reconstruction
- finding the shortest path
- graph representation
- attributed graphs
- betweenness centrality
- nodes of a graph
- shortest path
- graph partitioning
- spectral analysis
- average degree
- dominating set
- structured data
- bipartite graph
- network structure
- connected components
- planar graphs
- signal processing
- band limited
- graph matching
- graphical models
- graph model
- reconstruction method
- massive graphs
- high resolution
- bayesian networks
- real world graphs
- overlapping communities
- discrete tomography
- maximum flow
- graph mining
- graph clustering
- graph theoretic