Login / Signup
Efficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graph.
Edward Gimadi
Published in:
Appl. Math. Comput. (2015)
Keyphrases
</>
weighted graph
query processing
multi dimensional
segmentation algorithm
graph model
pairwise
vertex set