ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1302.4587
  4. Cited By
Efficient Parallel and External Matching
v1v2 (latest)

Efficient Parallel and External Matching

19 February 2013
M. Birn
Vitaly Osipov
Peter Sanders
Christian Schulz
Nodari Sitchinava
ArXiv (abs)PDFHTML

Papers citing "Efficient Parallel and External Matching"

2 / 2 papers shown
Title
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and
  Scalable
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable
Laxman Dhulipala
G. Blelloch
Julian Shun
GNN
100
150
0
14 May 2018
Recent Advances in Graph Partitioning
Recent Advances in Graph Partitioning
A. Buluç
Henning Meyerhenke
Ilya Safro
Peter Sanders
Christian Schulz
84
571
0
13 Nov 2013
1