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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.