Algorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems

Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich. Algorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems. In Susanne Albers, Tomasz Radzik, editors, Algorithms - ESA 2004, 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004, Proceedings. Volume 3221 of Lecture Notes in Computer Science, pages 122-133, Springer, 2004. [doi]

@inproceedings{BorosEG04,
  title = {Algorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems},
  author = {Endre Boros and Khaled M. Elbassioni and Vladimir Gurvich},
  year = {2004},
  url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3221&spage=122},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/BorosEG04},
  cites = {0},
  citedby = {0},
  pages = {122-133},
  booktitle = {Algorithms - ESA 2004, 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004, Proceedings},
  editor = {Susanne Albers and Tomasz Radzik},
  volume = {3221},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-23025-4},
}