Fast suboptimal algorithms for the computation of graph edit distance

Neuhaus, Michel; Riesen, Kaspar; Bunke, Horst (2006). Fast suboptimal algorithms for the computation of graph edit distance. In: Structural, Syntactic, and Statistical Pattern Recognition. Joint IAPR International Workshops, SSPR 2006 and SPR 2006, Hong Kong, China, August 17-19, 2006. Proceedings. Lecture Notes in Computer Science: Vol. 4109 (pp. 163-172). 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

Series:

Lecture Notes in Computer Science

Publisher:

Springer Verlag

Language:

English

Submitter:

Factscience Import

Date Deposited:

04 Oct 2013 14:45

Last Modified:

06 Dec 2013 13:41

Web of Science ID:

000240075100017

URI:

https://boris.unibe.ch/id/eprint/18726 (FactScience: 963)

Actions (login required)

Edit item Edit item
Provide Feedback