Advanced Search
MyIDEAS: Login to save this paper or follow this series

Large-Scale Graph Biconnectivity in MapReduce


Author Info

  • Giorgio Ausiello

    (Dipartimento di Informatica e Sistemistica "Antonio Ruberti" Sapienza, Universita' di Roma)

  • Donatella Firmani

    (Dipartimento di Informatica e Sistemistica "Antonio Ruberti" Sapienza, Universita' di Roma)

  • Luigi Laura

    (Dipartimento di Informatica e Sistemistica "Antonio Ruberti" Sapienza, Universita' di Roma)

  • Emanuele Paracone

    (Dep. of Computer Science, Systems and Production “Tor Vergata” Univ. of Rome)

Registered author(s):


    The MapReduce framework, originally proposed by Google, and its open source implementation, Hadoop, are nowadays considered the standard frameworks, both in industry and academia, to deal with petabyte scale datasets. In this paper we describe a two-rounds MapReduce approach to biconnectivity in undirected graphs, that is the computation of the set of articulation points, the set of bridges and the set of biconnected components of a graph G. We recall that an articulation point (resp. a bridge) is a vertex (resp. an edge) whose removal increases the number of connected components. A biconnected component is a maximal biconnected subgraph, i.e., it does not include neither articulation points nor bridges. In order to minimize the communication cost, the algorithm is based on a summary of the input data set, that is a compact data structure from which queries on biconnectivity properties can be answered. This summary, called navigational sketch, was originally designed in the data streams framework and was implicitly proved to be incrementally maintainable.Here we define it in a different framework in order to prove that it is mergeable . Mergeability is the key property of summaries in distributed or parallel computation: in particular, it provides a way to split the computation of the summary across separate subsets of the original data set, and thus to exploit the parallelism of the MapReduce framework. We finally discuss a scenario in which it is assumed that the machines have limited memory, showing tradeoffs between the memory available and the number of rounds of the algorithm. We conclude the paper with an experimental analysis that, on the basis of different executions of an Hadoop implementation of the algorithm against large-scale real world graphs, confirms the effectiveness of our approach..

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL:
    File Function: First version, 2012
    Download Restriction: no

    Bibliographic Info

    Paper provided by Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza" in its series DIS Technical Reports with number 2012-04.

    as in new window
    Date of creation: 2012
    Date of revision:
    Handle: RePEc:aeg:wpaper:2012-4

    Contact details of provider:
    Phone: +390677274140
    Fax: +39 0677274129
    Web page:
    More information through EDIRC

    Related research

    Keywords: Technology Transfer Offices (TTOs); French University System; Technical Efficiency; DEA; Bootstrap; Regional Growth;

    This paper has been announced in the following NEP Reports:


    No references listed on IDEAS
    You can help add them by filling out this form.



    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.


    Access and download statistics


    When requesting a correction, please mention this item's handle: RePEc:aeg:wpaper:2012-4. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Antonietta Angelica Zucconi).

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.