An efficient parallel graph edge matching algorithm and its applications

Jun Ma; Shaohan Ma

doi:10.1007/bf02946522

ScienceGate Book Chapters

JOURNAL ARTICLE

An efficient parallel graph edge matching algorithm and its applications

Jun Ma Shaohan Ma

Year: 1999 Journal: Journal of Computer Science and Technology Vol: 14 (2)Pages: 153-158 Publisher: Springer Science+Business Media

DOI: 10.1007/bf02946522

Get Full-Text PDF Get Analytical Report

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

Cited By

0.00

FWCI (Field Weighted Citation Impact)

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

An efficient parallel graph edge matching algorithm and its applications

Metrics

Citation History

Topics

Related Documents

Efficient parallel edge-centric approach for relaxed graph pattern matching

Parallel greedy graph matching using an edge partitioning approach

Efficient Algorithm for the b-Matching Graph

Efficient stereo matching algorithm with edge-detecting

An efficient parallel algorithm for term matching