Show simple item record

dc.contributor.authorVazirani, Vijay V.en_US
dc.date.accessioned2007-04-23T17:38:19Z
dc.date.available2007-04-23T17:38:19Z
dc.date.issued1989-09en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR89-1035en_US
dc.identifier.urihttps://hdl.handle.net/1813/6835
dc.description.abstractNo abstract is available.en_US
dc.format.extent3093015 bytes
dc.format.extent845981 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleA Theory of Alternating Paths and Blossoms for Proving Correctness of the $O(\sqrt{VE})$ General Graph Matching Algorithmen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics