pathcover.. - Programmers Heaven

Howdy, Stranger!

It looks like you're new here. If you want to get involved, click one of these buttons!


Welcome to the new platform of Programmer's Heaven! We apologize for the inconvenience caused, if you visited us from a broken link of the previous version. The main reason to move to a new platform is to provide more effective and collaborative experience to you all. Please feel free to experience the new platform and use its exciting features. Contact us for any issue that you need to get clarified. We are more than happy to help you.


ksr008ksr008 Posts: 1Member
A path cover of a directed graph is a set of paths such
that every vertex is included in exactly one path. The size of a path cover is the number of paths in the set.
can any one tell me how to reduce the problem of finding
a minimum-sized path cover in a directed acyclic graph to the problem of
finding a maximum-sized matching in a bipartite graph. such that the total running time of the algorithm should be in O(na).
Sign In or Register to comment.