A matching algorithm based on the depth first search for the general graph

被引：0
|
作者：
Yu, Chengcheng [1 ]
Sheng Zhonge [2 ]
机构：
[1] Hainan Coll Software Technol, Dept Network Engn, Qionghai 571400, Hainan, Peoples R China
[2] Hainan Univ, Coll Informat Sci & Technol, Haikou 570228, Hainan, Peoples R China
来源：
PROCEEDINGS OF THE 2ND INTERNATIONAL CONFERENCE ON INFORMATION, ELECTRONICS AND COMPUTER | 2014年 / 59卷
关键词：
Graph matching; Matching algorithm; Priority traversal; Flowering algorithm;
D O I：
暂无
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
In this paper, a matching algorithm of general graph based on depth-first traversal is proposed. The algorithm does not need to shrink and expand treatment when a flower is searched. This algorithm's time complexity of search an augmenting path is equal to corresponding graph's depth-first traversal algorithm's time complexity, it is one of the most efficient algorithm. Experiments show that this algorithm can correctly handle the associated practical problems, and have the correct conclusion.
引用
收藏
页码：59 / 63
页数：5
相关论文
共 50 条
  • [31] GRAPH SEARCH ALGORITHMS AND MAXIMUM BIPARTITE MATCHING ALGORITHM ON THE HYPERCUBE NETWORK MODEL
    SHEU, JP
    KUO, NL
    CHEN, GH
    PARALLEL COMPUTING, 1990, 13 (02) : 245 - 251
  • [32] A depth-first search algorithm based implementation approach of spanning tree in power system
    Tao, Hua
    Yang, Zhen
    Zhang, Min
    Yang, Jun-Xin
    He, Ren-Mu
    Shi, Yan
    Dianwang Jishu/Power System Technology, 2010, 34 (02): : 120 - 124
  • [33] THERMAL GENERATOR SCHEDULING ALGORITHM BASED ON HEURISTIC-GUIDED DEPTH-FIRST SEARCH
    WONG, KP
    CHEUNG, HN
    IEE PROCEEDINGS-C GENERATION TRANSMISSION AND DISTRIBUTION, 1990, 137 (01) : 33 - 43
  • [34] Recognizing unordered depth-first search trees of an undirected graph in parallel
    Peng, CH
    Wang, BF
    Wang, JS
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2000, 11 (06) : 559 - 570
  • [35] Limiting shape of the depth first search tree in an Erdos-Renyi graph
    Enriquez, Nathanael
    Faraud, Gabriel
    Menard, Laurent
    RANDOM STRUCTURES & ALGORITHMS, 2020, 56 (02) : 501 - 516
  • [36] A High-Order Depth-Based Graph Matching Method
    Bai, Lu
    Zhang, Zhihong
    Ren, Peng
    Hancock, Edwin R.
    COMPUTER ANALYSIS OF IMAGES AND PATTERNS, CAIP 2015, PT I, 2015, 9256 : 465 - 476
  • [37] A NOVEL BLOCK MATCHING ALGORITHM BASED ON CUCKOO SEARCH
    Bhattacharjee, Kamanasish
    Kumar, Sushil
    2017 2ND INTERNATIONAL CONFERENCE ON TELECOMMUNICATION AND NETWORKS (TEL-NET), 2017, : 452 - 456
  • [38] A general parsing algorithm with context matching for context-sensitive graph grammars
    Yang Zou
    Xiaoqin Zeng
    Yun Zhu
    Multimedia Tools and Applications, 2022, 81 : 273 - 297
  • [39] Deterministic search for relational graph matching
    Williams, ML
    Wilson, RC
    Hancock, ER
    PATTERN RECOGNITION, 1999, 32 (07) : 1255 - 1271
  • [40] Discrete Tabu Search for Graph Matching
    Adamczewski, Kamil
    Suh, Yumin
    Lee, Kyoung Mu
    2015 IEEE INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV), 2015, : 109 - 117
12345