搜索结果: 1-1 共查到“应用数学 Efficient Counting”相关记录1条 . 查询时间(0.094 秒)
Efficient Counting and Asymptotics of k-Noncrossing Tangled Diagrams
Efficient Counting Asymptotics k-Noncrossing Tangled Diagrams
2014/6/3
In this paper, we enumerate k-noncrossing tangled-diagrams. A tangled-diagram is a labeled graph with vertices 1,..., n, having degree ≤ 2, which are arranged in increasing order in a horizontal line....