OpenAlex
PricingAboutJobs
Log inGet started
Work

Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together

HTML

Year: 2019
Type: conference-paper
Source: ACM SIGMOD International Conference on Management of Data (SIGMOD)
Parent work: Proceedings of the 2019 International Conference on Management of Data
DOI: 10.1145/3299869.3319880
Authors: Myoungji Han, Hyunjoon Kim, Geonmo Gu, Kunsoo Park, Wook-Shin Han
Institutions: Seoul National University, Pohang University of Science and Technology
Language: English

Topic: Graph Theory and Algorithms
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: subgraph matching, subgraph isomorphism, dynamic programming, directed acyclic graphs, query graph, spanning trees, graph algorithms

Open Access status: closed
OpenAlex ID: W2948359422
FWCI: 14.16
Cites: 52
Cited by: 262
Related to: 10
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