A matching algorithms based on the depth first search for the general graph
Chengcheng Yu, Zhonge Sheng
Available Online March 2014.
- https://doi.org/10.2991/icieac-14.2014.14How to use a DOI?
- Graph matching; Matching algorithm; Priority traversal; Flowering algorithm;
- 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.
- Open Access
- This is an open access article distributed under the CC BY-NC license.
Cite this article
TY - CONF AU - Chengcheng Yu AU - Zhonge Sheng PY - 2014/03 DA - 2014/03 TI - A matching algorithms based on the depth first search for the general graph BT - Proceedings of the 2nd International Conference on Information, Electronics and Computer PB - Atlantis Press SP - 59 EP - 63 SN - 1951-6851 UR - https://doi.org/10.2991/icieac-14.2014.14 DO - https://doi.org/10.2991/icieac-14.2014.14 ID - Yu2014/03 ER -