NDLTD Global ETD Search
  • Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • Tagged with
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.

Search results

Showing 1 to 1 of 1 (0.044 seconds)

Spelling suggestions: "subject:"228 .414 no.4006998"" "subject:"228 .414 no.40061998""

1

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

January 1998 (has links)
Ravindra K. Ahuja, James B. Orlin. / "(Revised February 14, 1998.)"--T.p. -- "February 1998"--Cover. / Includes bibliographical references (p. 20). / Supported by a grant from the United Parcel Service and a contract from the Office of Naval Research. ONR N00014-96-1-0051
HD28 .M414 no.4006-98

Page generated in 0.0472 seconds