ZVMST:一种基于最小生成树的顶点查找算法
ZVMST: a minimum spanning tree-based vertex finder
摘要:
提出了一种新的拓扑顶点查找算法,它结合了成熟的ZVTOP算法的思想和一种新的最小生成树方法。一个初步的性能研究与模拟的e+e-> qqbar事件在一个中心的质量能量为92 GeV表明,新的方法是有竞争力的与现有的顶点查找算法。
英文摘要:
A new topological vertex finder is presented which combines ideas of the well-established ZVTOP algorithm with a novel minimum spanning tree approach. A preliminary performance study with simulated e+e- --> qqbar events at a centre of mass energy of 92 GeV shows that the new approach is competitive with existing vertex finder algorithms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。