Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms

Journal article

Peer reviewed

Journal of graph theory, Vol.53(3), pp.209-232

11/2006

Abstract

bipartite graphs

blockers

generation algorithms

matchable graphs

perfect matchings

9 Record Views

Title: Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms
Creators: Endre Boros - Rutcor, Rutgers University, 640 Bartholomew Road, Piscataway, NJ 08854-8003
Khaled Elbassioni - Max-Planck-Institut Für Informatik, Saarbrücken, Germany
Vladimir Gurvich - Rutcor, Rutgers University, 640 Bartholomew Road, Piscataway, NJ 08854-8003
Publication Details: Journal of graph theory, Vol.53(3), pp.209-232
Date published: 11/2006
Publisher: Wiley Subscription Services, Inc., A Wiley Company
Number of pages: 24
Academic Unit: Management Science and Information Systems (RBS)
Language: English
Resource Type: Journal article
Identifiers: 991031666270404646