Efficient computation of balanced structures

DOI10.1007/978-3-642-39212-2_51MaRDI QIDQ5327467zbMATH OpenOpenAlexFDO

Authors David G. Harris, Ehab Morsy, Gopal Pandurangan, Peter Robinson, Aravind Srinivasan

Publication date 7 August 2013

Published in Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-39212-2_51

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• Efficient computation of sparse structures
• An Improved Distributed Algorithm for Maximal Independent Set
• A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs
• MIS on trees
• Optimal dynamic distributed MIS

Cited in

(1)

• Efficient computation of sparse structures

This page was built for publication: Efficient computation of balanced structures

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