A GPU Algorithm for Greedy Graph Matching

By Bas Fagginger Auer, Rob H. Bisseling. 2011

54 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Computer Vision and Pattern Recognition, Hardware and Architecture, ML Systems & Hardware, Algorithms & Complexity

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

1. Matthias Fey
2. Jan Eric Lenssen

In Computer Vision and Pattern Recognition

1. Matthias Fey
2. Jan Eric Lenssen
3. Michael M. Bronstein
4. Uri Alon
5. Eran Yahav
6. Bernard Ghanem
7. Shuiwang Ji
8. Guohao Li

In Hardware and Architecture

1. Matthias Fey
2. Jan Eric Lenssen

In ML Systems & Hardware

1. Matthias Fey
2. Jan Eric Lenssen
3. Eran Yahav
4. Uri Alon
5. Michael M. Bronstein
6. Bernard Ghanem
7. Guohao Li
8. Yuxiao Dong

In Algorithms & Complexity

1. Matthias Fey
2. Jan Eric Lenssen

Citations in the corpus

• Fast Graph Representation Learning with PyTorch Geometric (2019, methodology): “We currently provide implementation examples for Graclus (Dhillon et al., 2007; Fagginger Auer & Bisseling, 2011) and voxel grid pooling (Simonovsky & Komodakis, 2017), the iterative farthest point sampling algorithm (Qi et al., 2017) followed by 𝑘 -NN or query ball graph generation (Qi et al., 201”