搜索结果: 1-2 共查到“数学 Word Problem”相关记录2条 . 查询时间(0.069 秒)
The word problem and the Aharoni-Berger-Ziv conjecture on the connectivity of independence complexes
Graphs independence complexes topological connectivity algorithm
2010/12/9
For each finite simple graph G, Aharoni, Berger and Ziv consider a recur-sively defined number (G) 2 Z [ {+1} which gives a lower bound for the topological connectivity of the independence complex IG...
Singular braids are isotopy classes of smooth strings which are allowed to cross each other pairwise with distinct tangents. Under the usual multiplication of braids, they form a monoid. The singular ...