OpenAlex
PricingAboutJobs
Log inGet started
Work

An efficient algorithm for graph edit distance computation

HTML PDF

Year: 2018
Type: article
Source: Knowledge-Based Systems
DOI: 10.1016/j.knosys.2018.10.002
Authors: Xiaoyang Chen, Hongwei Huo, Jun Huan, Jeffrey Scott Vitter
Institutions: Xidian University, Baidu (China), University of Mississippi
Language: English

Topic: Graph Theory and Algorithms
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: graph edit distance, search space reduction, heuristics, graph similarity search, graph classification

Open Access status: bronze

Funders: National Science Foundation, National Natural Science Foundation of China, Central University Basic Research Fund of China, Fundamental Research Funds for the Central Universities
Awards: 大规模序列数据集的压缩索引与搜索算法研究, G4410089691, G5571002835, AF: DC: Collaborative Research: Pattern Matching for Massive Data Sets, 多核系统下调控模式识别的MapReduce模型及算法研究
OpenAlex ID: W2897440725
FWCI: 3.274
Cites: 38
Cited by: 49
Related to: 9
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Subscribe
Supporters
Legal
Privacy
Accessibility
Terms
Security