scholarly journals Graphs where Search Methods are Indistinguishable

2021 ◽  
Author(s):  
Matjaž Krnc ◽  
Nevena Pivač
Keyword(s):  
Selection Rule ◽  
Search Method ◽  
Graph Search ◽  
Neighborhood Search ◽  
Graph Searching ◽  
Breadth First Search ◽  
Search Methods ◽  
Depth First Search ◽  
Graph Families ◽  
Vertex Order

Graph searching is one of the simplest and most widely used tools in graph algorithms. Every graph search method is defined using some partic-ular selection rule, and the analysis of the corre-sponding vertex orderings can aid greatly in de-vising algorithms, writing proofs of correctness, or recognition of various graph families. We study graphs where the sets of vertex order-ings produced by two di˙erent search methods coincide. We characterise such graph families for ten pairs from the best-known set of graph searches: Breadth First Search (BFS), Depth First Search (DFS), Lexicographic Breadth First Search (LexBFS) and Lexicographic Depth First Search (LexDFS), and Maximal Neighborhood Search (MNS).

scholarly journals Empirical study prove that breadth-first search is more effective memory usage than depth-first search in frontier boundary cyclic graph

2021 ◽  
Vol 10 (2) ◽  
pp. 265
Author(s):  
Al Refai Mohammed N. ◽  
Jamhawi Zeyad
Keyword(s):  
Memory Usage ◽  
Graph Searching ◽  
Breadth First Search ◽  
Memory Consumption ◽  
Depth First Search ◽  
Spiral Path ◽  
Level Number ◽  
Graph Size ◽  
Cyclic Graph ◽  
Better Than

<p><span id="docs-internal-guid-06e4528a-7fff-0e38-150e-f136d6f22d84"><span>Memory consumption, of opened and closed lists in graph searching algorithms, affect in finding the solution. Using frontier boundary will reduce the memory usage for a closed list, and improve graph size expansion. The blind algorithms, depth-first frontier Searches, and breadth-first frontier Searches were used to compare the memory usage in slide tile puzzles as an example of the cyclic graph. This paper aims to prove that breadth-first frontier search is better than depth-first frontier search in memory usage. Both opened and closed lists in the cyclic graph are used. The level number and nodes count at each level for slide tile puzzles are changed when starting from different empty tile location. Eventually, the unorganized spiral path in depth-first search appears clearly through moving inside the graph to find goals.</span></span></p>

scholarly journals Cluster Counting: The Hoshen–Kopelman Algorithm Versus Spanning Tree Approaches

1998 ◽  
Vol 09 (01) ◽  
pp. 43-60 ◽  
Author(s):  
F. Babalievski
Keyword(s):  
Spanning Tree ◽  
Theoretical Basis ◽  
Percolation Cluster ◽  
Search Method ◽  
Breadth First Search ◽  
Depth First Search ◽  
Counting Task ◽  
Basic Approaches ◽  
Pebble Game

Two basic approaches to the cluster counting task in the percolation and related models are discussed. The Hoshen–Kopelman multiple labeling technique for cluster statistics is redescribed. Modifications for random and aperiodic lattices are sketched as well as some parallelized versions of the algorithm are mentioned. The graph-theoretical basis for the spanning tree approaches is given by describing the breadth first search and depth first search procedures. Examples are given for extracting the elastic and geometric "backbone" of a percolation cluster. An implementation of the "pebble game" algorithm using a depth first search method is also described.

Partition-Based Hybrid MIMO Decoding Schemes with Combined Depth- and Breath-First Search

2013 ◽  
Vol 284-287 ◽  
pp. 2652-2656
Author(s):  
Jong In Park ◽  
Young Po Lee ◽  
Seok Ho Yoon
Keyword(s):  
Computational Complexity ◽  
Maximum Likelihood ◽  
Multiple Input Multiple Output ◽  
Search Algorithms ◽  
Search Method ◽  
Breadth First Search ◽  
Error Performance ◽  
Search Methods ◽  
Multiple Input ◽  
Input Multiple Output

In this paper, we propose a novel maximum likelihood (ML) decoding scheme based on the combination of depth- and breadth-first search methods on a partitioned tree for multiple input multiple output systems. The proposed scheme first partitions the searching tree into several stages, each of which is then searched by a depth- or breadth-first search method, possibly exploiting the advantages of both the depth- and breadth-first search methods in an organized way. Numerical results indicate that, when the depth- and breadth-first search algorithms are adopted appropriately, the proposed scheme exhibits substantially lower computational complexity than conventional ML decoders while maintaining the ML bit error performance.

scholarly journals ANALISA PERBANDINGAN BREADTH-FIRST SEARCH DAN DEPTHFIRST SEARCH PADA APLIKASI SISTEM PAKAR PENGOBATAN TRADISIONAL

Compiler ◽  
2013 ◽  
Vol 2 (2) ◽  
Author(s):  
Irisma Ifrisma ◽  
Anton Setiawan Honggowibowo ◽  
Nurcahyani Dewi Retnowati
Keyword(s):  
Comparative Analysis ◽  
Expert System ◽  
Traditional Medicine ◽  
Search Method ◽  
Prescription Medications ◽  
Test Results ◽  
Breadth First Search ◽  
Depth First Search ◽  
Search Results ◽  
Dead End

This research was conducted based on the need for tools for parents who have had children in determining a traditional medicine to treat illnesses suffered by children, toddlers and babies. Aids in the fo rm o f an expert system of traditional medicine. This expert system application can be run in a way that the disease name input experienced by children, toddlersand babies, then the expert system will provide information prescription medications to treat the disease. Search method used is the method of Breadth-First Search and Depth-First Search. Results of comparative analysis o f Breadth-First Search and Depth-First Search was concluded that the analysis using the Depth-First Search more quickly provide information about traditional medicine in comparison with using the method of Breadth-First Search. However, the use of the method of Breadth-First Search is superior compared with Depth-FirstSearch. This is because the method of Breadth-First Search will not find a dead end or to find a solution although it has only one solution. And if you have two solutions, the method of Breadth-First Search will find them. The test results of the application of expert system of traditional medicine in the 30 responders was 72.67%. Thus, the application of expert systemof traditional medicine by using Breadth-First Search and Depth-First S earch good.

Asynchronous P Systems

2014 ◽  
pp. 90-108
Author(s):  
Tudor Bălănescu ◽  
Radu Nicolescu ◽  
Huiling Wu
Keyword(s):  
Distributed Algorithms ◽  
Complexity Measure ◽  
P Systems ◽  
Breadth First Search ◽  
New Approach ◽  
Depth First Search ◽  
Empirical Results ◽  
A Performance

In this paper, the authors propose a new approach to fully asynchronous P systems, and a matching complexity measure, both inspired from the field of distributed algorithms. The authors validate the proposed approach by implementing several well-known distributed depth-first search (DFS) and breadth-first search (BFS) algorithms. Empirical results show that the proposed P algorithms have shorter descriptions and achieve a performance comparable to the corresponding distributed algorithms.

An Islanding Detection Method for Multi-RES Systems Using the Graph Search Method

2020 ◽  
Vol 11 (4) ◽  
pp. 2722-2731
Author(s):  
Ji-Soo Kim ◽  
Chul-Hwan Kim ◽  
Yun-Sik Oh ◽  
Gyu-Jung Cho ◽  
Jin-Sol Song
Keyword(s):  
Detection Method ◽  
Search Method ◽  
Graph Search ◽  
Islanding Detection

A Study on Automatic Setting Method of Protective Device in Korean Distribution System using Graph Search Method

2020 ◽  
Vol 69 (12) ◽  
pp. 1873-1878
Author(s):  
Ji-Soo Kim ◽  
Chul-Hwan Kim ◽  
Bo-Kyung Ko ◽  
Jin-Sol Song ◽  
Ho-Young Choi ◽  
...  
Keyword(s):  
Distribution System ◽  
Search Method ◽  
Graph Search ◽  
Protective Device
Sign in / Sign up

Export Citation Format

Share Document