scientific article; zbMATH DE number 7376014

DOI10.4230/LIPIcs.ICALP.2018.87zbMath1499.68283arXiv1703.05418MaRDI QIDQ5002766

Reut Levi, Christoph Lenzen

Publication date: 28 July 2021

Full work available at URL: https://arxiv.org/abs/1703.05418

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

sparsitylocal algorithmspanning graph

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Average Sensitivity of Graph Algorithms ⋮ Unnamed Item ⋮ Local algorithms for sparse spanning graphs

Cites Work

• Unnamed Item
• Can we locally compute sparse connected subgraphs?
• Converting Online Algorithms to Local Computation Algorithms
• A Local Computation Approximation Scheme to Maximum Matching
• Deterministic Stateless Centralized Local Algorithms for Bounded Degree Graphs
• Finding cycles and trees in sublinear time
• Local Algorithms for Sparse Spanning Graphs
• Graph spanners
• The Token Distribution Problem
• Efficient Algorithms for Constructing Very Sparse Spanners and Emulators
• A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor

This page was built for publication: