Fast Algorithms For HodgeRank Problems

Jiang, Zian


  • Least squares problems on graphs are a category of numerical linear algebra and optimization problems that are prevalent in ranking problems arising in real world networks. It has been an active research area to identify algorithms with good scalability. A notable work is from Colley et al, where they investigate the effectiveness of the unsmoothed aggregation algebraic multigrid (UA-AMG) and ... read more
This object is in collection Creator department Thesis Type Subject Genre Permanent URL
To Cite:
TARC Citation Guide    EndNote