Minimum perfect bipartite matchings and spanning trees under categorization

Authors:
Michael B. Richey;Abraham P. Punnen
Affiliations:
-;-
Venue:
Discrete Applied Mathematics
Year:
1992

Citing 0
Cited 3

The complexity of bottleneck labeled graph problems

WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
On two restricted ancestors tree problems

Information Processing Letters
Categorized bottleneck-minisum path problems on networks

Operations Research Letters

Quantified Score

Hi-index	0.04

Visualization

Abstract