Testing Bounded Arboricity

DOI10.1145/3381418zbMath1403.68160arXiv1707.04864OpenAlexW3012533071MaRDI QIDQ4608029

Dana Ron, Talya Eden, Reut Levi

Publication date: 15 March 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

property testinggraph arboricitygraph degeneracytolerant testing

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20)

Related Items (4)

Property testing of planarity in the \textsf{CONGEST} model ⋮ Single-pass streaming algorithms to partition graphs into few forests ⋮ Unnamed Item ⋮ Improved Dynamic Graph Coloring

This page was built for publication: Testing Bounded Arboricity