Home › Entities › academia › Space and Time Efficient Parallel Graph Decomposition, Clustering, and Diameter Approximation

Space and Time Efficient Parallel Graph Decomposition, Clustering, and Diameter Approximation

Research article (Proceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures, 2015) · cited 15× · AI/ML
academia openalex:W2070929497
Press Enter · cited answer in seconds

Space and Time Efficient Parallel Graph Decomposition, Clustering, and Diameter Approximation

Summary

Space and Time Efficient Parallel Graph Decomposition, Clustering, and Diameter Approximation is a scholarly article[1].

Key Facts

  • Space and Time Efficient Parallel Graph Decomposition, Clustering, and Diameter Approximation's instance of is recorded as scholarly article[2].

Related Entities

Eli Upfal

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [2] ↑ . wikidata.org.

Class ancestry

  1. [1] ↑ . Wikidata. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). Space and Time Efficient Parallel Graph Decomposition, Clustering, and Diameter Approximation. Retrieved May 24, 2026, from https://4ort.xyz/entity/space-and-time-efficient-parallel-graph-decomposition-clustering-and-diameter-approximation
MLA “Space and Time Efficient Parallel Graph Decomposition, Clustering, and Diameter Approximation.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/space-and-time-efficient-parallel-graph-decomposition-clustering-and-diameter-approximation.
BibTeX @misc{4ortxyz_space-and-time-efficient-parallel-graph-decomposition-clustering-and-diameter-approximation_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Space and Time Efficient Parallel Graph Decomposition, Clustering, and Diameter Approximation}}, year = {2026}, url = {https://4ort.xyz/entity/space-and-time-efficient-parallel-graph-decomposition-clustering-and-diameter-approximation}, note = {Accessed: 2026-05-24}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Space and Time Efficient Parallel Graph Decomposition, Clustering, and Diameter Approximation — https://4ort.xyz/entity/space-and-time-efficient-parallel-graph-decomposition-clustering-and-diameter-approximation (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/space-and-time-efficient-parallel-graph-decomposition-clustering-and-diameter-approximation · Last refreshed: