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 条
  • [1] A FAST LABELED GRAPH MATCHING ALGORITHM BASED ON EDGE MATCHING AND GUIDED BY SEARCH ROUTE
    Dai, Yin-Tang
    Zhang, Shi-Yong
    PROCEEDINGS OF 2009 INTERNATIONAL CONFERENCE ON WAVELET ANALYSIS AND PATTERN RECOGNITION, 2009, : 1 - 7
  • [2] An Algorithm for Map Coloring Problem based on Depth First Search
    Gao, Fan
    Mai, XiaoZheng
    Cui, Bingliang
    ADVANCED RESEARCH ON ENGINEERING MATERIALS, ENERGY, MANAGEMENT AND CONTROL, PTS 1 AND 2, 2012, 424-425 : 480 - +
  • [3] Parallel algorithm research of graph search and depth learning based on data mining
    Wang, Liping
    PROCEEDINGS OF THE 2016 2ND INTERNATIONAL CONFERENCE ON MATERIALS ENGINEERING AND INFORMATION TECHNOLOGY APPLICATIONS (MEITA 2016), 2017, 107 : 210 - 214
  • [4] An external-memory depth-first search algorithm for general grid graphs
    Her, Jun-Ho
    Ramakrishna, R. S.
    THEORETICAL COMPUTER SCIENCE, 2007, 374 (1-3) : 170 - 180
  • [5] A new algorithm for minimum spanning tree using depth-first-search in an undirected graph
    SalehiFathabadi, H
    Ahrabian, H
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1995, 57 (3-4) : 157 - 161
  • [6] An Improved Algorithm for Searching Maze Based on Depth-First Search
    Chen, Ying-Hsuan
    Wu, Chang-Ming
    2020 IEEE INTERNATIONAL CONFERENCE ON CONSUMER ELECTRONICS - TAIWAN (ICCE-TAIWAN), 2020,
  • [7] The Algorithm of Noise Image Compression Based on Adaptive Depth First Search
    Xia Ping
    Liu Xin-qiong
    Xiang Xue-jun
    Wan Jun-li
    ICSP: 2008 9TH INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING, VOLS 1-5, PROCEEDINGS, 2008, : 950 - +
  • [8] A Distributed Depth First Search based Algorithm for Edge Connectivity Estimation
    Ugurlu, Onur
    Akram, Vahid Khalilpour
    Eliiyi, Deniz Tursel
    2020 16TH INTERNATIONAL CONFERENCE ON NETWORK AND SERVICE MANAGEMENT (CNSM), 2020,
  • [9] A Graph Matching Approach based on Aggregated Search
    Echbarthi, Ghizlane
    Kheddouci, Hamamache
    2017 13TH INTERNATIONAL CONFERENCE ON SIGNAL-IMAGE TECHNOLOGY AND INTERNET-BASED SYSTEMS (SITIS), 2017, : 376 - 379
  • [10] Backward heuristic search algorithm BHAO for general AND/OR graph
    Wang, Shitong
    Ruan Jian Xue Bao/Journal of Software, 1994, 5 (03):
12345