OpenAlex
PricingAboutJobs
Log inGet started
Work

Fast Suboptimal Algorithms for the Computation of Graph Edit Distance

HTML

Year: 2006
Type: conference-paper
Source: Lecture notes in computer science
Parent work: Structural, Syntactic, and Statistical Pattern Recognition: Joint IAPR International Workshops, SSPR 2006 and SPR 2006, Hong Kong, China, August 17-19, 2006. Proceedings
DOI: 10.1007/11815921_17
Authors: Michel Neuhaus, Kaspar Riesen, Horst Bunke
Institution: University of Bern
Language: English

Topic: Graph Theory and Algorithms
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: graph edit distance, suboptimal algorithms, attributed graphs, computational complexity, algorithm acceleration

Open Access status: closed
OpenAlex ID: W1597213869
FWCI: 5.029
Cites: 17
Cited by: 276
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
Supporters
Legal
Privacy
Accessibility
Terms