I
Ilya Safro
Researcher at University UCINF
Publications - 139
Citations - 2848
Ilya Safro is an academic researcher from University UCINF. The author has contributed to research in topics: Computer science & Support vector machine. The author has an hindex of 22, co-authored 127 publications receiving 2155 citations. Previous affiliations of Ilya Safro include Argonne National Laboratory & Clemson University.
Papers
More filters
Book ChapterDOI
Recent Advances in Graph Partitioning
TL;DR: In this article, the authors survey recent trends in practical algorithms for balanced graph partitioning, point to applications, and discuss future research directions, and present a survey of the most popular algorithms.
Book ChapterDOI
Comparison of Coarsening Schemes for Multilevel Graph Partitioning
Cédric Chevalier,Ilya Safro +1 more
TL;DR: This work compares two multilevel frameworks based on the geometric and the algebraic multigrid schemes for the partitioning problem.
Posted Content
Relaxation-based coarsening and multiscale graph organization
Dorit Ron,Ilya Safro,Achi Brandt +2 more
TL;DR: This paper generalize and improve the multiscale organization of graphs by introducing a new measure that quantifies the "closeness" between two nodes that is linear in the number of edges in the graph.
Journal ArticleDOI
Relaxation-Based Coarsening and Multiscale Graph Organization
Dorit Ron,Ilya Safro,Achi Brandt +2 more
TL;DR: In this paper, a new measure that quantifies the closeness between two nodes is introduced, which is linear in the number of edges in the graph and involves just a small number of relaxation sweeps.
Journal ArticleDOI
Algebraic Distance on Graphs
Jie Chen,Ilya Safro +1 more
TL;DR: This paper considers an iterative process that smooths an associated value for nearby vertices, and presents a measure of the local connection strength, called the algebraic distance, which is attractive in that the process is simple, linear, and easily parallelized.