Dartmouth logo Dartmouth College Computer Science
Technical Report series
CS home
TR home
TR search TR listserv
By author: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
By number: 2017, 2016, 2015, 2014, 2013, 2012, 2011, 2010, 2009, 2008, 2007, 2006, 2005, 2004, 2003, 2002, 2001, 2000, 1999, 1998, 1997, 1996, 1995, 1994, 1993, 1992, 1991, 1990, 1989, 1988, 1987, 1986

Chain Match: An Algorithm for Finding a Perfect Matching of a Regular Bipartite Multigraph
Stefanie L. Ostrowski
Dartmouth TR2014-753

Abstract: We consider the problem of performing an edge coloring of a d-regular bipartite multigraph G = (V, E). While an edge coloring can be found by repeatedly performing Euler partitions on G, doing so requires that the degree of G be a power of 2. One way to allow the Euler partitioning method to continue in cases where d is not a power of 2 is to remove a perfect matching from the graph after any partition that results in a graph with an odd degree. If this perfect matching can be identified in O(E) time, we can maintain the best case runtime for this coloring of O(E lg d). This paper presents Chain Match, an algorithm that finds a perfect matching in a d-regular bipartite multigraph. While we have proven that Chain Match will always terminate with a perfect matching, we have not been able to implement it within our goal runtime of O(E).

Note: Senior Honors Thesis. Advisor: Tom Cormen.


PDF PDF (204KB)

Bibliographic citation for this report: [plain text] [BIB] [BibTeX] [Refer]

Or copy and paste:
   Stefanie L. Ostrowski, "Chain Match: An Algorithm for Finding a Perfect Matching of a Regular Bipartite Multigraph." Dartmouth Computer Science Technical Report TR2014-753, May 2014.


Notify me about new tech reports.

Search the technical reports.

To receive paper copy of a report, by mail, send your address and the TR number to reports AT cs.dartmouth.edu


Copyright notice: The documents contained in this server are included by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a non-commercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

Technical reports collection maintained by David Kotz.