31 citations · 104 across the 17 of their papers we have counts for
4 papers · 1 filter
Understanding Coarsening for Embedding Large-Scale Graphs
Taha Atahan Akyildiz, Amro Alabsi Aljundi, Kamer Kaya
A significant portion of the data today, e.g, social networks, web connections, etc., can be modeled by graphs. A proper analysis of graphs with Machine Learning (ML) algorithms ha…
GOSH: Embedding Big Graphs on Small Hardware
Taha Atahan Akyildiz, Amro Alabsi Aljundi, Kamer Kaya
In graph embedding, the connectivity information of a graph is used to represent each vertex as a point in a d-dimensional space. Unlike the original, irregular structural informat…
Vertex Ordering Algorithms for Graph Coloring Problem
Arda Asik, Ibrahim Bugra Demir, Berker Demirel +2
Graph coloring is a fundamental problem in combinatorics with many applications in practice. In this problem, the vertices in a given graph must be colored by using the least numbe…
Boosting Parallel Influence-Maximization Kernels for Undirected Networks with Fusing and Vectorization
Gokhan Gokturk, Kamer Kaya
Influence maximization (IM) is the problem of finding a seed vertex set which is expected to incur the maximum influence spread on a graph. It has various applications in practice…