Testing bounded arboricity

MaRDI QIDQ6829548zbMATH OpenFDO

Authors Talya Eden, Reut Levi, Dana Ron

Publication date 15 March 2018

Full work available at URL http://dl.acm.org/citation.cfm?id=3175441

Mathematics Subject Classification ID

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

This page was built for publication: Testing bounded arboricity

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