Local Computation Algorithms for Graphs of Non-constant Degrees
© 2016, Springer Science+Business Media New York. In the model of local computation algorithms (LCAs), we aim to compute the queried part of the output by examining only a small (sublinear) portion of the input. Many recently developed LCAs on graph problems achieve time and space complexities with...
Main Authors: | Levi, Reut (Author), Rubinfeld, Ronitt (Author), Yodpinyanee, Anak (Author) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor) |
Format: | Article |
Language: | English |
Published: |
Springer Nature,
2022-04-28T23:43:34Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Local Computation Algorithms for Graphs of Non-constant Degrees
by: Levi, Reut, et al.
Published: (2021) -
Local computation algorithms for graphs of non-constant degrees
by: Yodpinyanee, Anak
Published: (2015) -
Local Algorithms for Sparse Spanning Graphs
by: Levi, Reut, et al.
Published: (2016) -
A Local Algorithm for Constructing Spanners in Minor-Free Graphs
by: Levi, Reut, et al.
Published: (2017) -
Local access to huge random objects through partial sampling
by: Yodpinyanee, Anak, et al.
Published: (2021)