On the k-feasible matching problem for graphs with a partial ordering on vertices (Technical report series / Ohio State University. Computer and Information Science Research Center)

Written by Ten-Hwang Lai