Graph reconstruction in the congested clique.
Pedro MontealegreSebastian Perez-SalazarIvan RapaportIoan TodincaPublished in: J. Comput. Syst. Sci. (2020)
Keyphrases
- maximum weight
- graph properties
- three dimensional
- weighted graph
- quasi cliques
- independent set
- maximum clique
- graph structure
- graph matching
- random walk
- directed graph
- graph theory
- graph partitioning
- graph representation
- graph theoretic
- maximum independent set
- undirected graph
- clique tree
- compressed sensing
- reconstruction process
- minimum spanning tree
- spanning tree
- graph mining
- bipartite graph
- image reconstruction
- np complete
- d objects