Advanced Search

A fast algorithm for the bipartite node weighted matching problmem on path graphics with application to the inverse spanning tree problem

Research and Teaching Output of the MIT Community

Planned maintenance alert - Monday, April 21: DSpace@MIT will undergo maintenance activities that will affect service availability and access to file content. While the service interruptions should be brief, access to file content may take longer to restore. Status updates will be posted to

Files in this item

Name Size Format Description
SWP-4006-40963012.pdf 1.440Mb PDF

This item appears in the following Collection(s)