Results 21 to 30 of about 190,756 (265)
Scalable Aspects Learning for Intent-Aware Diversified Search on Social Networks
IEEE Access, 2018 Search result diversification on networks aims at selecting a set of representative nodes in response to a given query node so that the result is able to meet users' ambiguous query intents.
Zaiqiao Meng, Hong Shen
doaj +1 more source
Knowledge Management for Injection Molding Defects by a Knowledge Graph
Applied Sciences, 2022 Injection molding is a technique with a high knowledge content. However, most of the injection molding knowledge is stored in books, and it is difficult for personnel to clarify the influence of the different factors.
Zhe-Wei Zhou +3 more
doaj +1 more source
Solving Graph Coloring Problem Based on Grover Algorithm [PDF]
Jisuanji kexue, 2023 Grover quantum search algorithm is a famous quantum algorithm designed for unstructured search problems.It can be used to solve problems such as graph coloring and shortest path sorting,and can also effectively decipher cryptosystems.Graph coloring ...
LIU Xiaonan, LIU Zhengyu, XIE Haoshan, ZHAO Chenyan
doaj +1 more source
Influence of the tie-break rule on the end-vertex problem [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 End-vertices of a given graph search may have some nice properties, as for example it is well known that the last vertex of Lexicographic Breadth First Search (LBFS) in a chordal graph is simplicial, see Rose, Tarjan and Lueker 1976.
Pierre Charbit +2 more
doaj +1 more source
Mathematics, 2021 The structural property of the search graph plays an important role in the success of local search-based metaheuristic algorithms. Magnification is one of the structural properties of the search graph.
Ajitha K. B. Shenoy, Smitha N. Pai
doaj +1 more source
Search Algorithms for the Combinatorial Generation of Bordered Box Repetition-Free Words [PDF]
Journal of Universal Computer Science, 2023 A bordered box repetition-free word is a finite word w where any given factor of the form asa, with a ∈ Σ and s ∈ Σ∗, occurs at most once.
Trienko Grobler +3 more
doaj +3 more sources
Recognizing Graph Search Trees
Electronic Notes in Theoretical Computer Science, 2019 Graph searches and the corresponding search trees can exhibit important structural properties and are used in various graph algorithms. The problem of deciding whether a given spanning tree of a graph is a search tree of a particular search on this graph was introduced by Hagerup and Nowak in 1985, and independently by Korach and Ostfeld in 1989 where ...
Beisegel, Jesse +6 more
openaire +3 more sources
Graph Extremities Defined by Search Algorithms
Algorithms, 2010 Graph search algorithms have exploited graph extremities, such as the leaves of a tree and the simplicial vertices of a chordal graph. Recently, several well-known graph search algorithms have been collectively expressed as two generic algorithms called ...
Jean-Paul Bordat +3 more
doaj +1 more source
The Search for Minimal Search: A Graph-Theoretic Approach
Biolinguistics, 2023 This paper examines Minimal Search, an operation that is at the core of current Minimalist inquiry. We argue that, given Minimalist assumptions about structure building consisting of unordered set-formation, there are serious difficulties in defining ...
Diego Gabriel Krivochen
doaj +1 more source
Graph Similarity Search with High Efficiency and Low Index [PDF]
Jisuanji kexue, 2023 Graph similarity search is to search the graph set that is similar to query graph under a measurement,which adopts the “filtering-verification” framework.Aiming at the problems of the existing methods,such as the untight lower bound and the large index ...
QIU Zhen, ZHENG Zhaohui
doaj +1 more source