Efficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graph

Edward Gimadi. Efficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graph. Applied Mathematics and Computation, 255:84-91, 2015. [doi]

Possibly Related Publications

The following publications are possibly variants of this publication: