In a block of parallel edges (e.g., three edges between A and B), only one edge receives the correct biconnected component label. The rest are incorrectly assigned component ID 0 — even though they ...

Abstract: We present an experimental study of parallel biconnected components algorithms employing several fundamental parallel primitives, e.g., prefix sum, list ranking, sorting, connectivity, ...

This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that ...

Due to a planned power outage on Friday, 1/14, between 8am-1pm PST, some services may be impacted. A line drawing of the Internet Archive headquarters building façade. An illustration of a magnifying ...

Abstract: Quasi-trees, namely graphs with tree-like structure, appear in many application domains, including bioinformatics and computer networks. Our new SPF approach exploits the structure of these ...