ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1802.07510
  4. Cited By
Spectrally approximating large graphs with smaller graphs

Spectrally approximating large graphs with smaller graphs

21 February 2018
Andreas Loukas
P. Vandergheynst
ArXiv (abs)PDFHTML

Papers citing "Spectrally approximating large graphs with smaller graphs"

4 / 54 papers shown
Title
A Unified Framework for Structured Graph Learning via Spectral
  Constraints
A Unified Framework for Structured Graph Learning via Spectral Constraints
Sandeep Kumar
Jiaxi Ying
José Vinícius de Miranda Cardoso
Daniel P. Palomar
86
115
0
22 Apr 2019
Approximating Spectral Clustering via Sampling: a Review
Approximating Spectral Clustering via Sampling: a Review
Nicolas M Tremblay
Andreas Loukas
70
46
0
29 Jan 2019
Graph reduction with spectral and cut guarantees
Graph reduction with spectral and cut guarantees
Andreas Loukas
48
4
0
31 Aug 2018
Fast Approximate Spectral Clustering for Dynamic Networks
Fast Approximate Spectral Clustering for Dynamic Networks
Lionel Martin
Andreas Loukas
P. Vandergheynst
133
18
0
12 Jun 2017
Previous
12