نتایج جستجو برای: preorder traversal
تعداد نتایج: 4844 فیلتر نتایج به سال:
Graph burning is a process to determine the spreading of information in graph. If sequence vertices burns all graph by following process, then such known as sequence. The problem consists finding minimum length for given solution this NP-hard combinatorial optimization helps quantify graph’s vulnerability contagion. This paper introduces simple farthest-first traversal-based approximatio...
In this paper, we present a topological neighborhood expression which allows us to express arbitrary neighborhood around cells in unstructured meshes. We show that the expression can be evaluated by traversing the connectivity information of the meshes. We implemented two algebraic operators which use the expression to compute neighbors of cells and approximate data fields of cells by aggregati...
Rich metadata in high-performance computing (HPC) systems contains extended information about users, jobs, data files, and their relationships. Property graphs are a promising data model to represent heterogeneous rich metadata flexibly. Specifically, a property graph can use vertices to represent different entities and edges to record the relationships between vertices with unique annotations....
We introduce the concept of a fuzzy total preorder. Then we analyze its numerical representability through a real-valued order-preserving function defined for each α-cut.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید