A quadratic programming approach to the graph edit distance problem

Neuhaus, Michel; Bunke, Horst (2007). A quadratic programming approach to the graph edit distance problem. In: Graph-Based Representations in Pattern Recognition. 6th IAPR-TC-15 International Workshop, GbRPR 2007, Alicante, Spain, June 11-13, 2007. Proceedings. Lecture Notes in Computer Science: Vol. 4538 (pp. 92-102). Heidelberg: Springer Verlag

Full text not available from this repository. (Request a copy)

Item Type: Conference or Workshop Item (Paper)
Division/Institute: 08 Faculty of Science > Institute of Computer Science (INF)
UniBE Contributor: Neuhaus, Michel and Bunke, Horst
ISBN: 978-3-540-72902-0 92
Series: Lecture Notes in Computer Science
Publisher: Springer Verlag
Language: English
Submitter: Factscience Import
Date Deposited: 04 Oct 2013 15:01
Last Modified: 06 Dec 2013 13:51
Web of Science ID: 000247365900009
URI: http://boris.unibe.ch/id/eprint/26474 (FactScience: 72079)

Actions (login required)

Edit item Edit item
Provide Feedback