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]

Authors

Edward Gimadi

This author has not been identified. Look up 'Edward Gimadi' in Google