Finding 1-factors in bipartite regular graphs, and edge-coloring bipartite graphs

Rizzi, Romeo (2002) Finding 1-factors in bipartite regular graphs, and edge-coloring bipartite graphs. UNSPECIFIED.

[img]
Preview
PDF
Download (212Kb) | Preview

    Abstract

    This paper gives a new and faster algorithm to find a 1-factor in a bipartite D-regular graph. The time complexity of this algorithm is O(n D + n log n log D), where n is the number of nodes. This implies an O(n log n log D + m log D) algorithm to edge-color a bipartite graph with n nodes, m edges and maximum degree D.

    Item Type: Departmental Technical Report
    Department or Research center: Information Engineering and Computer Science
    Subjects: Q Science > QA Mathematics > QA075 Electronic computers. Computer science
    Uncontrolled Keywords: time-tabling, edge-coloring, perfect matching, regular bipartite graphs
    Additional Information: Published in SIAM Journal on Discrete Mathematics
    Report Number: DIT-02-038
    Repository staff approval on: 21 Jan 2003

    Actions (login required)

    View Item