Results 31 to 40 of about 190,756 (265)
Automated 3-D Retinal Layer Segmentation From SD-OCT Images With Neurosensory Retinal Detachment
IEEE Access, 2019 Neurosensory retinal detachment (NRD) is a separation of the neurosensory retina from the retinal pigment epithelium (RPE) because of the subretinal fluid that can result in significant vision loss.
Loza Bekalo +8 more
doaj +1 more source
Efficient Top-k Graph Similarity Search With GED Constraints
IEEE Access, 2022 It is essential to identify similarity between graphs for various tasks in data mining, machine learning and pattern recognition. Graph edit distance (GED) is the most popular graph similarity measure thanks to its flexibility and versatility.
Jongik Kim
doaj +1 more source
Clique Search in Graphs of Special Class and Job Shop Scheduling
Mathematics, 2022 In this paper, we single out the following particular case of the clique search problem. The vertices of the given graph are legally colored with k colors and we are looking for a clique with k nodes in the graph.
Sándor Szabó, Bogdán Zaválnij
doaj +1 more source
Applied Sciences, 2017 The measurement of the thicknesses of layers is important for the quality assurance of industrial coating systems. Current measurement techniques only provide a limited amount of information.
Samuel Lawman +4 more
doaj +1 more source
Efficient Breadth-First Reduct Search
Mathematics, 2020 This paper formulates the problem of determining all reducts of an information system as a graph search problem. The search space is represented in the form of a rooted graph.
Veera Boonjing, Pisit Chanvarasuth
doaj +1 more source
Graph drawing using tabu search coupled with path relinking. [PDF]
PLoS ONE, 2018 Graph drawing, or the automatic layout of graphs, is a challenging problem. There are several search based methods for graph drawing which are based on optimizing an objective function which is formed from a weighted sum of multiple criteria.
Fadi K Dib, Peter Rodgers
doaj +1 more source
Connecting Cities: Solving Optimal-Resource-Distribution Problem Using Critical Range Radius
InfrastructuresNavigating and planning optimal paths for resource delivery algorithms poses significant physical and technical challenges in urban areas, primarily due to the limitations of existing infrastructure. As smart cities continue to develop, the importance of
Jorge L. Perez-Ramos +2 more
doaj +1 more source
How Many Lions Are Needed to Clear a Grid?
Algorithms, 2009 We consider a pursuit-evasion problem where some lions have the task to clear a grid graph whose nodes are initially contaminated. The contamination spreads one step per time unit in each direction not blocked by a lion.
Rolf Klein +3 more
doaj +1 more source
Transactions on Networks and Communications, 2017 To determine that two given undirected graphs are isomorphic, we construct for them auxiliary graphs, using the breadth-first search. This makes capability to position vertices in each digraph with respect to each other. If the given graphs are isomorphic, in each of them we can find such positionally equivalent auxiliary digraphs that have the same ...
openaire +3 more sources
Queue, 2020 Welcome to Drill Bits , a new column about programming. This inaugural episode shows how graph search algorithms can avoid unnecessary work. A simple modification to classic breadth-first search improves the lower bound on its running time: Whereas classic BFS always requires time proportional to the number of ...
openaire +1 more source