Login / Signup
Algorithms Based on Path Contraction Carrying Weights for Enumerating Subtrees of Tricyclic Graphs.
Yu Yang
Beifang Chen
Guoping Zhang
Yongming Li
Daoqiang Sun
Hongbo Liu
Published in:
Comput. J. (2022)
Keyphrases
</>
edge weights
significant improvement
graph theory
computational cost
computationally efficient
weighted graph
data structure
worst case
linear combination
theoretical analysis
shortest path
weighted sum
web graph
graph search