Publication

Fast Parallel Algorithms for Enumeration of Simple, Temporal, and Hop-Constrained Cycles

Related publications (32)

About
Privacy
Disclaimer

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Fast Parallel Algorithms for Enumeration of Simple, Temporal, and Hop-Constrained Cycles

Graph Chatbot

Chat with Graph Search

Performing and Detecting Backdoor Attacks on Face Recognition Algorithms

Intermediate Address Space: virtual memory optimization of heterogeneous architectures for cache-resident workloads

Fast Parallel Algorithms for Enumeration of Simple, Temporal, and Hop-constrained Cycles

Building Chips Faster: Hardware-Compiler Co-Design for Accelerated RTL Simulation

Compilation and Design Space Exploration of Dataflow Programs for Heterogeneous CPU-GPU Platforms

Acceleration of graph pattern mining and applications to financial crime

Results on Sparse Integer Programming and Geometric Independent Sets

Acceleration of Control Intensive Applications on Coarse-Grained Reconfigurable Arrays for Embedded Systems

Bayesian reconstruction of memories stored in neural networks from their connectivity

Augmented Lagrangian Methods for Provable and Scalable Machine Learning