Full Text Available
Note: Clicking the button above will open the full text document at the original institutional repository in a new window.
Parallel Reachability and Shortest Paths on Non-sparse Digraphs: Near-linear Work and Sub-square-root Depth
Saved in:
| Published in: | ArXiv cs.DS Recent Papers |
|---|---|
| Format: | Online Article RSS Article |
| Published: |
2026
|
| Subjects: | |
| Tags: |
No Tags, Be the first to tag this record!
|
| _version_ | 1864493180023472134 |
|---|---|
| collection | WordPress RSS FRELIP Feed Integration |
| container_title | ArXiv cs.DS Recent Papers |
| description | |
| discipline_display | Engineering & Technology |
| discipline_facet | Engineering & Technology |
| format | Online Article RSS Article |
| genre | Journal Article |
| id | rss_article:49859 |
| institution | FRELIP |
| journal_source_facet | ArXiv cs.DS Recent Papers |
| publishDate | 2026 |
| publishDateSort | 2026 |
| record_format | rss_article |
| spellingShingle | Parallel Reachability and Shortest Paths on Non-sparse Digraphs: Near-linear Work and Sub-square-root Depth ArXiv cs.DS Recent Papers Computer Science & IT Engineering & Technology |
| sub_discipline_display | Computer Science & IT |
| sub_discipline_facet | Computer Science & IT |
| subject_display | ArXiv cs.DS Recent Papers Computer Science & IT Engineering & Technology ArXiv cs.DS Recent Papers Computer Science & IT Engineering & Technology |
| subject_facet | ArXiv cs.DS Recent Papers Computer Science & IT Engineering & Technology |
| title | Parallel Reachability and Shortest Paths on Non-sparse Digraphs: Near-linear Work and Sub-square-root Depth |
| title_auth | Parallel Reachability and Shortest Paths on Non-sparse Digraphs: Near-linear Work and Sub-square-root Depth |
| title_full | Parallel Reachability and Shortest Paths on Non-sparse Digraphs: Near-linear Work and Sub-square-root Depth |
| title_fullStr | Parallel Reachability and Shortest Paths on Non-sparse Digraphs: Near-linear Work and Sub-square-root Depth |
| title_full_unstemmed | Parallel Reachability and Shortest Paths on Non-sparse Digraphs: Near-linear Work and Sub-square-root Depth |
| title_short | Parallel Reachability and Shortest Paths on Non-sparse Digraphs: Near-linear Work and Sub-square-root Depth |
| title_sort | parallel reachability and shortest paths on non-sparse digraphs: near-linear work and sub-square-root depth |
| topic | ArXiv cs.DS Recent Papers Computer Science & IT Engineering & Technology |
| url | https://arxiv.org/abs/2605.03892v1 |