• Home
  • Search
  • The Algorithm for Constructing Extremal Graphs Based on MapReduce
  • Cite Icon1
  • https://doi.org/10.1109/icndc.2012.21Copy DOI Icon

The Algorithm for Constructing Extremal Graphs Based on MapReduce

  • Oct 1, 2012
  • Sun Yongqi +2 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

MapReduce is a common programming model for processing and generating large datasets at present. Using the model, the programming for distributed computing can be easier than others. The extremal graph is a graph with the maximum number of edges such that it does not contain given sub graph. The method of constructing extremal graphs is an important research content in Graph Theory. The algorithm of constructing extremal graphs based on the MapReduce programming model is studied in this paper. By mapping the key-value pairs of MapReduce model properly, the parallel constructing algorithms are designed and implemented. Finally, we construct extremal graphs not containing hexagons and with no more than 26 vertices using the algorithm. By the results of experiments, it is showed that the average speedup is 2.55, and the average efficiency is 85%.

Similar Papers
  • Research Article
  • Citations4

Горизонтальне та вертикальне масштабування методів машинного навчання

  • Jan 01, 2019
  • PROBLEMS IN PROGRAMMING
  • B.O Biletskyy
  • Book Chapter

Data Centric Text Processing Using MapReduce

  • Dec 15, 2015
  • N Sandhya +1
  • Conference Article
  • Citations2

A case for MapReduce over the internet

  • Aug 09, 2013
  • Hrishikesh Gadre +3
  • Conference Article
  • Citations40

Provenance for MapReduce-based data-intensive workflows

  • Nov 14, 2011
  • Daniel Crawl +2
  • Research Article
  • Citations29

Handling Data-skew Effects in Join Operations Using MapReduce

  • Jan 01, 2014
  • Procedia Computer Science
  • M Al Hajj Hassan +2
  • Research Article
  • Citations45

Extremal graphs for homomorphisms

  • Feb 09, 2011
  • Journal of Graph Theory
  • Jonathan Cutler +1
  • Book Chapter
  • Citations1

Parallel kNN Queries for Big Data Based on Voronoi Diagram Using MapReduce

  • Jan 01, 2016
  • Wei Yan
  • Conference Article
  • Citations3

Parallel Processing of Frequent Itemset Based on MapReduce Programming Model

  • Sep 01, 2019
  • Rajshree A Deshmukh +2
  • Conference Article
  • Citations28

Apache Hadoop Yarn Parameter configuration Challenges and Optimization

  • Feb 01, 2015
  • Bhavin J Mathiya +1
  • PDF
  • Research Article
  • Citations10

Big Data Recommendation Research Based on Travel Consumer Sentiment Analysis.

  • Feb 28, 2022
  • Frontiers in Psychology
  • Zhu Yuan
  • Research Article

Обеспечение безопасной маршрутизации в беспроводных самоорганизующихся сетях

  • Jan 01, 2022
  • Voprosy kiberbezopasnosti
  • Sabina Volkov +1
  • Research Article
  • Citations9

Fibonacci index and stability number of graphs: a polyhedral study

  • May 21, 2009
  • Journal of Combinatorial Optimization
  • Véronique Bruyère +1
  • Supplementary Content

Extremal and probabilistic results for regular graphs

  • Jan 01, 2017
  • London School of Economics and Political Science Research Online (London School of Economics and Political Science)
  • Ewan Davies
  • Supplementary Content

Extremal Graph Theory for Minors, Improper Colourings and Gonality

  • Mar 21, 2019
  • Kevin Hendrey
  • Research Article

On the maximum number of edges in -critical graphs

  • Jul 24, 2023
  • Combinatorics, Probability and Computing
  • Cong Luo +2
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.