The distributed algorithm for constructing extremal graphs without hexagon

zbMATH Open1339.05408MaRDI QIDQ2815802FDOQ2815802

Authors: Yongqi Sun, Nan Zhao, Rui Zhang 

Publication date: 30 June 2016

Published in: International Journal of Applied Mathematics and Statistics (Search for Journal in Brave)

Full work available at URL: http://www.ceser.in/ceserp/index.php/ijamas/article/view/3246

Recommendations

• Efficient primal-dual graph algorithms for MapReduce
• scientific article; zbMATH DE number 6297759
• Clique counting in MapReduce: algorithms and experiments
• Colorful triangle counting and a \textsc{MapReduce} implementation
• Lessons from the Congested Clique Applied to MapReduce

zbMATH Keywords

distributed computingMapReduceextremal graphHadoop

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Extremal problems in graph theory (05C35) Paths and cycles (05C38)

This page was built for publication: The distributed algorithm for constructing extremal graphs without hexagon

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