Algorithms for generating minimal blockers of perfect matchings in bipartite graphs and related problems

Conference proceeding

Peer reviewed

Lecture notes in computer science, Vol.3221, pp.122-133

Algorithms - ESA 2004 (Bergen, 14-17 September 2004)

2004

Abstract

Algorithmics. Computability. Computer arithmetics

Applied sciences

Computer science; control theory; systems

Exact sciences and technology

Theoretical computing

9 Record Views

Title: Algorithms for generating minimal blockers of perfect matchings in bipartite graphs and related problems
Creators: Endre Boros - RUTCOR, Rutgers University, 640 Bartholomew Road, Piscataway NJ 08854-8003, United States
Khaled Elbassioni - RUTCOR, Rutgers University, 640 Bartholomew Road, Piscataway NJ 08854-8003, United States
Vladimir Gurvich - RUTCOR, Rutgers University, 640 Bartholomew Road, Piscataway NJ 08854-8003, United States
Publication Details: Lecture notes in computer science, Vol.3221, pp.122-133
Conference: Algorithms - ESA 2004 (Bergen, 14-17 September 2004)
Date published: 2004
Publisher: Springer
Academic Unit: Management Science and Information Systems (RBS)
Language: English
Resource Type: Conference proceeding
Identifiers: 991031665452704646