JOURNAL ARTICLE

An efficient parallel graph edge matching algorithm and its applications

Jun MaShaohan Ma

Year: 1999 Journal:   Journal of Computer Science and Technology Vol: 14 (2)Pages: 153-158   Publisher: Springer Science+Business Media
Keywords:
Theory of computation Computer science Combinatorics Bounded function Matching (statistics) Parallel algorithm Planar graph Time complexity Binary logarithm Algorithm Graph Discrete mathematics Mathematics

Metrics

2
Cited By
0.00
FWCI (Field Weighted Citation Impact)
8
Refs
0.13
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Complexity and Algorithms in Graphs
Physical Sciences →  Computer Science →  Computational Theory and Mathematics
Advanced Graph Theory Research
Physical Sciences →  Computer Science →  Computational Theory and Mathematics
Optimization and Search Problems
Physical Sciences →  Computer Science →  Computer Networks and Communications

Related Documents

JOURNAL ARTICLE

Efficient stereo matching algorithm with edge-detecting

Jing LiuXinzhu SangChangxin JiaNan GuoYangdong LiuGuozhong Shi

Journal:   Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE Year: 2014 Vol: 9273 Pages: 927335-927335
BOOK-CHAPTER

An efficient parallel algorithm for term matching

Rakesh VermaT R KrishnaprasadI. V. Ramakrishnan

Lecture notes in computer science Year: 1986 Pages: 504-518
© 2026 ScienceGate Book Chapters — All rights reserved.