Skip to main navigation
Skip to search
Skip to main content
New Jersey Institute of Technology Home
Help & FAQ
Home
Profiles
Research units
Facilities
Federal Grants
Research output
Press/Media
Search by expertise, name or affiliation
Approximate Graph Matching Using Probabilistic Hill Climbing Algorithms
Jason T.L. Wang
, Kaizhong Zhang
, Gung Wei Chirn
Computer Science
Research output
:
Contribution to journal
›
Conference article
›
peer-review
4
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Approximate Graph Matching Using Probabilistic Hill Climbing Algorithms'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Approximate Graph Matching
100%
Hill Climbing
100%
Minimum Distance
50%
DNA Molecule
50%
Heuristic Algorithms
50%
Graph Operations
50%
Weighted Sums
50%
Data Graph
50%
Pattern Graph
50%
Time Efficiency
50%
Labeled Graph
50%
Graph Matching Problem
50%
P-NP
50%
Computer Science
Graph Matching
100%
Hill Climbing
100%
Efficient Algorithm
50%
Subgraphs
50%
Time Efficiency
50%
Heuristic-Based Algorithm
50%
Labelled Graph
50%
Mathematics
Approximates
100%
Edge
50%
Matching Problem
50%
Heuristic Algorithm
50%
Weighted Sum
50%
Engineering
Graph Node
100%