Speeding up Graph Edit Distance Computation through Fast Bipartite Matching
Loading...
Authors
Author (Corporation)
Publication date
2011
Typ of student thesis
Course of study
Collections
Type
04B - Conference paper
Editors
Jiang, Xiaoyi
Ferrer, Miquel
Torsello, Andrea
Editor (Corporation)
Supervisor
Parent work
Proceedings 8th International Workshop on Graph Based Representations in Pattern Recognition
Special issue
DOI of the original publication
Link
Series
Series number
Volume
Issue / Number
Pages / Duration
102-111
Patent number
Publisher / Publishing institution
Place of publication / Event location
Edition
Version
Programming language
Assignee
Practice partner / Client
Keywords
Event
Proceedings 8th International Workshop on Graph Based Representations in Pattern Recognition
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
Peer review of the complete publication
Open access category
License
Citation
Fankhauser, S., Riesen, K., & Bunke, H. (2011). Speeding up Graph Edit Distance Computation through Fast Bipartite Matching. In X. Jiang, M. Ferrer, & A. Torsello (eds.), Proceedings 8th International Workshop on Graph Based Representations in Pattern Recognition (pp. 102–111). http://hdl.handle.net/11654/9192