scholarly journals An optimal graph-search method for secure state estimation

Automatica ◽  
2021 ◽  
Vol 123 ◽  
pp. 109323
Author(s):  
Xusheng Luo ◽  
Miroslav Pajic ◽  
Michael M. Zavlanos
Keyword(s):  
State Estimation ◽  
Search Method ◽  
Graph Search ◽  
Optimal Graph

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

LOGISMOS-JEI: Segmentation using optimal graph search and just-enough interaction

2020 ◽  
pp. 249-272
Author(s):  
Honghai Zhang ◽  
Kyungmoo Lee ◽  
Zhi Chen ◽  
Satyananda Kashyap ◽  
Milan Sonka
Keyword(s):  
Graph Search ◽  
Optimal Graph

Simultaneous Segmentation of Bladder and Prostate using Globally Optimal 3-D Graph Search Method

2008 ◽  
Vol 72 (1) ◽  
pp. S148
Author(s):  
Q. Song ◽  
Y. Yin ◽  
M. Chen ◽  
Y. Kim ◽  
J. Bayouth ◽  
...  
Keyword(s):  
Search Method ◽  
Graph Search

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).

Sign in / Sign up

Export Citation Format

Share Document