Chinese 径宽 Cited by user 書畫晝盡 on 31 Jan 2024 图论中,图G的径分解(path decomposition)是G的“加粗”路径图表示, G的径宽(pathwidth)是衡量形成G的路径被加粗的程度. 更正式地说,径分解是G的顶点子集序列,使每条边的端点出现在某一子集中,并使每个顶点都出现在子集连续子序列中, 径宽等于这样的分解中最大集的大小减一.
English Order-maintenance problem Cited by user Farach on 17 Feb 2022 In computer science, the order-maintenance problem involves maintaining a totally ordered set supporting the following operations:.
English Geometric spanner Cited by user Surajshetiya on 16 Mar 2021 A geometric spanner or a -spanner graph or a -spanner was initially introduced as a weighted graph over a set of points as its vertices for which there is a -path…
English Greedy geometric spanner Cited by user Surajshetiya on 16 Mar 2021 In computational geometry, a greedy geometric spanner is an undirected graph whose vertices represent points in a Euclidean space, and whose edges are selected by a…