45 citations · 137 across the 22 of their papers we have counts for
6 papers · 1 filter
A Simple and Elegant Mathematical Formulation for the Acyclic DAG Partitioning Problem
M. Yusuf Özkaya, Ümit V. Çatalyürek
This work addresses the NP-Hard problem of acyclic directed acyclic graph (DAG) partitioning problem. The acyclic partitioning problem is defined as partitioning the vertex set of…
A Block-Based Triangle Counting Algorithm on Heterogeneous Environments
Abdurrahman Yaşar, Sivasankaran Rajamanickam, Jonathan Berry +1
Triangle counting is a fundamental building block in graph algorithms. In this paper, we propose a block-based triangle counting algorithm to reduce data movement during both seque…
On Symmetric Rectilinear Matrix Partitioning
Abdurrahman Yaşar, Muhammed Fatih Balin, Xiaojing An +2
Even distribution of irregular workload to processing units is crucial for efficient parallelization in many applications. In this work, we are concerned with a spatial partitionin…
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…
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…
Hypergraph Partitioning through Vertex Separators on Graphs
Enver Kayaaslan, Ali Pinar, Umit V. Catalyurek +1
The modeling flexibility provided by hypergraphs has drawn a lot of interest from the combinatorial scientific community, leading to novel models and algorithms, their applications…