  This report evaluates the efficiency of Graph Edit Distance (GED) computation
for graph similarity search, comparing Cascading Metric Trees (CMT) with
brute-force verification. Despite the anticipated advantages of CMT, our
findings indicate it does not consistently outperform brute-force methods in
speed. The study, based on graph data from PubChem, suggests that the
computational complexity of GED-based GSS remains a challenge.
