16 citations · 28 across the 5 of their papers we have counts for
5 papers
GPU accelerated maximum cardinality matching algorithms for bipartite graphs
Mehmet Deveci, Kamer Kaya, Bora Ucar +1
We design, implement, and evaluate GPU-based algorithms for the maximum cardinality matching problem in bipartite graphs. Such algorithms have a variety of applications in computer…
Incremental Algorithms for Network Management and Analysis based on Closeness Centrality
Ahmet Erdem Sariyuce, Kamer Kaya, Erik Saule +1
Analyzing networks requires complex algorithms to extract meaningful information. Centrality metrics have shown to be correlated with the importance and loads of the nodes in netwo…
Performance Evaluation of Sparse Matrix Multiplication Kernels on Intel Xeon Phi
Erik Saule, Kamer Kaya, Umit V. Catalyurek
Intel Xeon Phi is a recently released high-performance coprocessor which features 61 cores each supporting 4 hardware threads with 512-bit wide SIMD registers achieving a peak theo…
Shattering and Compressing Networks for Centrality Analysis
Ahmet Erdem Sarıyüce, Erik Saule, Kamer Kaya +1
Who is more important in a network? Who controls the flow between the nodes or whose contribution is significant for connections? Centrality metrics play an important role while an…
Diversifying Citation Recommendations
Onur Küçüktunç, Erik Saule, Kamer Kaya +1
Literature search is arguably one of the most important phases of the academic and non-academic research. The increase in the number of published papers each year makes manual sear…