Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
Abstract. We provide new tools, such as k-troikas and good subtreerepresentations, that allow us to give fast and simple algorithms computing branchwidth. We show that a graph G ha...
If G is a connected graph with N nodes, its r dimensional product contains Nr nodes. We present an algorithm which sorts Nr keys stored in the rdimensional product of any graph G ...
Abstract. We present a new technique for discovering and representing structural changes between two versions of a directed acyclic graph (DAG). Motivated by the necessity of chang...
Speedups demonstrated for finding the biconnected components of a graph: 9x to 33x on the Explicit Multi-Threading (XMT) many-core computing platform relative to the best serial ...