Efficient parallel graph edge matching algorithm and its applications

被引:0
|
作者
Ma, Jun [1 ]
Ma, Shaohan [1 ]
机构
[1] Shandong Univ, Jinan, China
来源
关键词
Number:; -; Acronym:; NSF; Sponsor: National Science Foundation; SDU; Sponsor: Shandong University; Acronym: [!text type='JS']JS[!/text]PS; Sponsor: Japan Society for the Promotion of Science;
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
页码:153 / 158
相关论文
共 50 条
  • [31] Similarity flooding: A versatile graph matching algorithm and its application to schema matching
    Melnik, S
    Garcia-Molina, H
    Rahm, E
    18TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, PROCEEDINGS, 2002, : 117 - 128
  • [32] An efficient parallel algorithm for maximum matching for some classes of graphs
    Parfenoff, I
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1998, 52 (01) : 96 - 108
  • [33] A parallel clustering algorithm on the star graph and its performance
    Sarbazi-Azad, Hamid
    Zarandi, Hamid R.
    Fazeli, Mahdi
    MATHEMATICAL AND COMPUTER MODELLING, 2013, 58 (3-4) : 880 - 891
  • [34] An efficient parallel algorithm for hierarchical block matching motion estimation
    Konstantopoulos, C
    Svolos, A
    Kaklamanis, C
    VISUAL COMMUNICATIONS AND IMAGE PROCESSING '99, PARTS 1-2, 1998, 3653 : 481 - 490
  • [35] An efficient parallel algorithm for exact multi-pattern matching
    Zhang, Hongli
    Xu, Dongliang
    Tian, Zhihong
    Fan, Yujian
    SECURITY AND COMMUNICATION NETWORKS, 2015, 8 (09) : 1688 - 1697
  • [36] Odd graph and its applications to the strong edge coloring
    Wang, Tao
    Zhao, Xiaodan
    APPLIED MATHEMATICS AND COMPUTATION, 2018, 325 : 246 - 251
  • [37] An Efficient Parallel Algorithm for Graph-Based Image Segmentation
    Wassenberg, Jan
    Middelmann, Wolfgang
    Sanders, Peter
    COMPUTER ANALYSIS OF IMAGES AND PATTERNS, PROCEEDINGS, 2009, 5702 : 1003 - +
  • [38] An Efficient Parallel Algorithm for Maximal Clique Enumeration in a Large Graph
    Tang X.-C.
    Zhou J.-W.
    Tian K.-F.
    Li Z.-H.
    Jisuanji Xuebao/Chinese Journal of Computers, 2019, 42 (03): : 513 - 531
  • [39] An efficient hierarchical parallel genetic algorithm for graph coloring problem
    Department of Computer Science, University of Regina, Regina, Canada
    Genet. Evol. Comput. Conf., GECCO, (521-528):
  • [40] ON THE EXISTENCE OF AN EFFICIENT PARALLEL ALGORITHM FOR A GRAPH-THEORETIC PROBLEM
    ZEROVNIK, J
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 591 : 359 - 368