Fast algorithms for maximum subset matching and all-pairs shortest paths in graphs with a (not so) small vertex cover

Noga Alon, Raphael Yustcr

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Fingerprint

Dive into the research topics of 'Fast algorithms for maximum subset matching and all-pairs shortest paths in graphs with a (not so) small vertex cover'. Together they form a unique fingerprint.

Keyphrases

Computer Science

Mathematics