Sublinear graph augmentation for fast query implementation

DOI10.1007/978-3-030-04693-4_12OpenAlexW2903327508MaRDI QIDQ1757769FDOQ1757769

Authors: Artur Czumaj, Yishay Mansour, Shai Vardi 

Publication date: 15 January 2019

Full work available at URL: https://doi.org/10.1007/978-3-030-04693-4_12

Recommendations

• scientific article; zbMATH DE number 1775414
• Approximating Average Parameters of Graphs
• A sublinear bipartiteness tester for bounded degree graphs
• Deterministic stateless centralized local algorithms for bounded degree graphs
• On the probe complexity of local computation algorithms

zbMATH Keywords

sublinear algorithmslocal computation algorithmsgraph augmentation

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Approximation algorithms (68W25)

Cited In (1)

• Average Sensitivity of Graph Algorithms

This page was built for publication: Sublinear graph augmentation for fast query implementation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1757769)