NDLI: An Empirical Study of Two MIS Algorithms

Content Provider	IEEE Xplore Digital Library
Author	Bisht, T. Kothapalli, K.
Copyright Year	2013
Description	Author affiliation: Int. Inst. of Inf. Technol., Hyderabad, India (Bisht, T.; Kothapalli, K.)
Abstract	Distributed algorithms for computing a maximal independent set of a graph have been very popular in the research community. Starting with the algorithm of Luby dating back to 25 years, several researchers have focused on distributed MIS algorithms for general graphs. with little success. Only recently, M'etevier et al. have proposed an algorithm for MIS in the distributed setting with a round complexity that matches Luby's algorithm asymptotically. However, very little is known about the relative performance of the algorithm of Luby and M'etevier in practice. Such a study can throw light on some aspects of the algorithms that are not brought out by a theoretical analysis. In this paper, we compare implementations of the algorithm of Luby and M'etevier and study their behavior on a class of random graphs and bipartite graphs. Further, we study how varying the probability that a node wishes to join the MIS in the case of Luby's algorithm affects the number of rounds required.
Starting Page	24
Ending Page	28
File Size	199283
Page Count	5
File Format	PDF
ISBN	9780769551272
DOI	10.1109/ADCONS.2013.9
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2013-12-15
Publisher Place	India
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Algorithm design and analysis Metevier Heuristic algorithms Luby MIS Probabilistic logic Bipartite graph Partitioning algorithms Complexity theory Security
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Rectangle Counting in Large Bipartite Graphs

Probabilistic Event-Driven Heuristic Fault Localization using Incremental Bayesian Suspected Degree

A low time complexity defect-tolerance algorithm for nanoelectronic crossbar

Fair Maximal Independent Sets

Two algorithms for Network Security Gradient marking

Bipartite Folding and Partitioning of a PLA

A PROBE-Based Heuristic for Graph Partitioning

Optimal Bipartite Folding of PLA

An Algorithm for Determining Critical Bipartite Graphs

An Empirical Study of Two MIS Algorithms

Similar Documents

Rectangle Counting in Large Bipartite Graphs

Probabilistic Event-Driven Heuristic Fault Localization using Incremental Bayesian Suspected Degree

A low time complexity defect-tolerance algorithm for nanoelectronic crossbar

Fair Maximal Independent Sets

Two algorithms for Network Security Gradient marking

Bipartite Folding and Partitioning of a PLA

A PROBE-Based Heuristic for Graph Partitioning

Optimal Bipartite Folding of PLA

An Algorithm for Determining Critical Bipartite Graphs

An Empirical Study of Two MIS Algorithms