Keyword: Computational complexity : Search

Applied Filters

People

Publications

Publication Date

2 Results for: Keyword: Computational complexityEdit SearchSave SearchRSS

Searched The ACM Guide to Computing Literature (3,815,653 records)|Limit your search to The ACM Full-Text Collection (772,220 records)

Showing 1 - 2of2 Results

Select All

Export Citations Save to Binder

per page:

Recency

research-article
February 2024
Distributed half-integral matching and beyond
- Sameep Dahal,
- Jukka Suomela
Theoretical Computer Science (TCSC), Volume 982, Issue Chttps://doi.org/10.1016/j.tcs.2023.114278
Abstract
By prior work, it is known that any distributed graph algorithm that finds a maximal matching requires Ω ( log ⁎ ⁡ n ) communication rounds, while it is possible to find a maximal fractional matching in O ( 1 ) rounds in bounded-degree graphs. ...
0
Metrics
Total Citations0
research-article
March 2023
Distributed graph problems through an automata-theoretic lens
Theoretical Computer Science (TCSC), Volume 951, Issue Chttps://doi.org/10.1016/j.tcs.2023.113710
Abstract
The locality of a graph problem is the smallest distance T such that each node can choose its own part of the solution based on its radius-T neighborhood. In many settings, a graph problem can be solved efficiently with a distributed ...
0
Metrics
Total Citations0