2026-08-02T01:58:33Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:21285 2024-10-28T09:51:04Z ddc:004 open_access

How Can Biclique Covers Help in Matching Problems (Invited Talk) Cheong, Otfried Matching problems 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Otfried Cheong 2024 Is Part Of LIPIcs, Volume 320, 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.GD.2024.1 urn:nbn:de:0030-drops-212853 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.GD.2024.1 eng https://creativecommons.org/licenses/by/4.0/legalcode