This is an artifact that aims for reproducing experiments mentioned in the "Parallelizing Maximal Clique Enumeration on GPUs" paper by generating similar figures and tables. The artifact consists of three main components: (1) a compiled binary for executing maximal clique enumeration on GPUs, (2) a docker image that packages the dependencies of the binary, and (3) a set of scripts for downloading the datasets used in the paper and executing the binary to reproduce the experimental results reported in the paper
We present shared-memory parallel methods for Maximal Clique Enumeration (MCE) from a graph. MCE is ...
This paper presents parallel algorithms for component decomposition of graph structures on General P...
Includes bibliographical references (leave 34).Maximal clique enumeration is one of the most importa...
This is an artifact that aims for reproducing experiments mentioned in the "Parallelizing Maximal Cl...
We present an iterative breadth-first approach to maximum clique enumeration on the GPU. The memory ...
The enumeration of all maximal cliques in an undirected graph is a fundamental problem arising in se...
This is the artifacts of paper "Efficient Maximal Biclique Enumeration on GPUs", which will appear i...
Maximal clique enumeration and maximum clique generation are well known NP-complete discrete optimiz...
The availability and utility of large numbers of Graphical Processing Units (GPUs) have enabled para...
This article presents parallel algorithms for component decomposition of graph structures on general...
This artifact is concerned with Section 5 (Evaluation) of the paper "Accelerating Nested Data Parall...
Graphics Processing Units (GPUs) are a fast evolving architecture. Over the last decade their progra...
Maximal clique enumeration (MCE) is a long-standing problem in graph theory and has numerous importa...
Abstract—Graphics Processing Units (GPUs) are becoming increasingly important in high performance co...
Background: The maximum clique enumeration (MCE) problem asks that we identify all maximum cliques i...
We present shared-memory parallel methods for Maximal Clique Enumeration (MCE) from a graph. MCE is ...
This paper presents parallel algorithms for component decomposition of graph structures on General P...
Includes bibliographical references (leave 34).Maximal clique enumeration is one of the most importa...
This is an artifact that aims for reproducing experiments mentioned in the "Parallelizing Maximal Cl...
We present an iterative breadth-first approach to maximum clique enumeration on the GPU. The memory ...
The enumeration of all maximal cliques in an undirected graph is a fundamental problem arising in se...
This is the artifacts of paper "Efficient Maximal Biclique Enumeration on GPUs", which will appear i...
Maximal clique enumeration and maximum clique generation are well known NP-complete discrete optimiz...
The availability and utility of large numbers of Graphical Processing Units (GPUs) have enabled para...
This article presents parallel algorithms for component decomposition of graph structures on general...
This artifact is concerned with Section 5 (Evaluation) of the paper "Accelerating Nested Data Parall...
Graphics Processing Units (GPUs) are a fast evolving architecture. Over the last decade their progra...
Maximal clique enumeration (MCE) is a long-standing problem in graph theory and has numerous importa...
Abstract—Graphics Processing Units (GPUs) are becoming increasingly important in high performance co...
Background: The maximum clique enumeration (MCE) problem asks that we identify all maximum cliques i...
We present shared-memory parallel methods for Maximal Clique Enumeration (MCE) from a graph. MCE is ...
This paper presents parallel algorithms for component decomposition of graph structures on General P...
Includes bibliographical references (leave 34).Maximal clique enumeration is one of the most importa...