2020
DOI: 10.4230/lipics.opodis.2019.35
|View full text |Cite
|
Sign up to set email alerts
|

Massively Parallel Approximate Distance Sketches

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(1 citation statement)
references
References 0 publications
0
1
0
Order By: Relevance
“…In [9], the productivity of the maximum flow, determined using the Ford-Fulkerson algorithm on grid and random geometric graphs, was studied. In [7], combinatorial structures for weighted graphs with a low field volume were studied by the same method.…”
Section: Literature Reviewmentioning
confidence: 99%