4 papers · 1 filter
Succinct Graph Representations and Algorithmic Applications
Ahammed Ullah, Alex Pothen
We propose new graph representations that exploit dense local structure to improve time and space simultaneously. Given an undirected graph , we define a dual clique cover (DCC)…
Weighted Matching in a Poly-Streaming Model
Ahammed Ullah, S. M. Ferdous, Alex Pothen
We introduce the poly-streaming model, a generalization of streaming models of computation in which processors process data streams containing a total of items. The alg…
Computing Clique Cover with Structural Parameterization
Ahammed Ullah
An abundance of real-world problems manifest as covering edges and/or vertices of a graph with cliques that are optimized for some objectives. We consider different structural para…
A Framework for Computing Greedy Clique Cover
Ahammed Ullah
Structural parameters of graph (such as degeneracy and arboricity) had rarely been considered when designing algorithms for problems. Taking degenera…