A Max-min Weight Perfect Matching in Bipartite Graph with Two Edge Weights

Home > Archive>Volume 16, Issue 4, 1994 >98-101

A Max-min Weight Perfect Matching in Bipartite Graph with Two Edge Weights
DOI:
                        
CSTR:
                        
Author:
                        
Affiliation:
Clc Number:
Fund Project:

Article

Figures

Metrics

Reference

Cited by

Materials

Comments

Abstract:

In this paper, we built a network model of max-min weight perfect matching in the bipartite graph with two edge weights,and give an efficient algorithm for it. Lastly, we solve a particular assignment problem.

Reference

Cited by

Get Citation

Xie Zheng, Chen Haoguang. A Max-min Weight Perfect Matching in Bipartite Graph with Two Edge Weights[J]. Journal of National University of Defense Technology,1994,16(4):98-101.

Copy

Article Metrics

Abstract:
PDF:
HTML:
Cited by:

History

Received:May 25,1993
Revised:
Adopted:
Online: January 23,2015
Published:

Home

About Journal

Guide for Authors

Editorial Board

Publication Statement

Open Access Statement

Contact

Journal Subscription

Rss

AI assistant

Chinese

Get Citation

Share

Article Metrics

History

Article QR Code