"I/O-efficient approximation of graph diameters by parallel cluster growing ..."

Deepak Ajwani et al. (2012)

> Home

Details and statistics

DOI: —

access: open

type: Conference or Workshop Paper

metadata version: 2024-10-14

- view
- export record
  dblp key:
  - conf/arcs/AjwaniBMV11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/arcs/AjwaniBMV11
Deepak Ajwani, Andreas Beckmann, Ulrich Meyer, David Veith:
I/O-efficient approximation of graph diameters by parallel cluster growing - a first experimental study. ARCS Workshops 2012: 493-504

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.