图搜索的一种tie-break模型
A tie-break model for graph search
摘要:
在本文中,我们考虑的问题,识别各种排序产生的图搜索。为此,我们引入了一个新的框架,打破标签搜索(TBLS),以处理各种各样的搜索。这个新模型基于在标签集上定义的偏序,它统一了Krueger,Simonet和Berry(2011)的通用标签搜索(GLS)形式主义,以及Corneil和Krueger(2008)的“模式条件”形式主义。它使我们能够获得一些一般属性,包括新的模式条件(产生内存效率的证书),许多常见的搜索,包括BFS,DFS,LBFS和LDFS。此外,新的模型允许容易地表达多扫描使用的搜索,依赖于以前的(搜索)排序的图的顶点集。
英文摘要:
In this paper, we consider the problem of the recognition of various kinds of orderings produced by graph searches. To this aim, we introduce a new framework, the Tie-Breaking Label Search (TBLS), in order to handle a broad variety of searches. This new model is based on partial orders defined on the label set and it unifies the General Label Search (GLS) formalism of Krueger, Simonet and Berry (2011), and the "pattern-conditions" formalism of Corneil and Krueger (2008). It allows us to derive some general properties including new pattern-conditions (yielding memory-efficient certificates) for many usual searches, including BFS, DFS, LBFS and LDFS. Furthermore, the new model allows easy expression of multi-sweep uses of searches that depend on previous (search) orderings of the graph's vertex set.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。