Speeding up Graph Edit Distance Computation with a Bipartite Heuristic
Loading...
Authors
Author (Corporation)
Publication date
2007
Typ of student thesis
Course of study
Collections
Type
04B - Conference paper
Editors
Frasconi, Paolo
Kersting, Kristian
Tsuda, Koji
Editor (Corporation)
Supervisor
Parent work
Proc. 5th Int. Workshop on Mining and Learning with Graphs
Special issue
DOI of the original publication
Link
Series
Series number
Volume
Issue / Number
Pages / Duration
21-24
Patent number
Publisher / Publishing institution
Place of publication / Event location
Edition
Version
Programming language
Assignee
Practice partner / Client
Keywords
Event
Exhibition start date
Exhibition end date
Conference start date
Conference end date
Date of the last check
ISBN
ISSN
Language
English
Created during FHNW affiliation
Unknown
Strategic action fields FHNW
Publication status
Published
Review
No peer review
Open access category
License
Citation
Riesen, K., Fankhauser, S., & Bunke, H. (2007). Speeding up Graph Edit Distance Computation with a Bipartite Heuristic. In P. Frasconi, K. Kersting, & K. Tsuda (eds.), Proc. 5th Int. Workshop on Mining and Learning with Graphs (pp. 21–24). http://hdl.handle.net/11654/9352