Efficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graph
Work
Year: 2015
Type: article
Author È. Kh. Gimadi
Institution Sobolev Institute of Mathematics
Cites: 22
Cited by: 1
Related to: 10
FWCI:
Citation percentile (by year/subfield): 60.08
Subfield: Industrial and Manufacturing Engineering
Field: Engineering
Domain: Physical Sciences
Open Access status: closed