LIPIcs.GD.2024.1.pdf
- Filesize: 326 kB
- 1 pages
Document
How Can Biclique Covers Help in Matching Problems (Invited Talk)
Author
Otfried Cheong 
-
Part of:
Volume:
32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: Graph Drawing and Network Visualization (GD) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2024-10-28
File
Document Identifiers
Author Details
Cite AsGet BibTex
Otfried Cheong. How Can Biclique Covers Help in Matching Problems (Invited Talk). In 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 320, p. 1:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.GD.2024.1
https://doi.org/10.4230/LIPIcs.GD.2024.1
Abstract
In several settings one encounters assignment or matching problems between objects of two different types, and needs to run a computation on a bipartite graph. While this graph can potentially be dense, it can sometimes be represented compactly using a biclique cover. This is in particular often the case when the objects are geometric - we will look at examples, and see how recent progress on maximum flow can be combined with such biclique covers to obtain faster algorithms.
Subject Classification
ACM Subject Classification
- Mathematics of computing → Graph algorithms
Keywords
- Matching problems
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads