Approximate graph edit distance computation by means of bipartite graph matching

Riesen, Kaspar; Bunke, Horst (2009). Approximate graph edit distance computation by means of bipartite graph matching. Image and vision computing, 27(7), pp. 950-959. Amsterdam: Elsevier 10.1016/j.imavis.2008.04.004

Full text not available from this repository.

Item Type:	Journal Article (Original Article)
Division/Institute:	08 Faculty of Science > Institute of Computer Science (INF)
UniBE Contributor:	Riesen, Kaspar, Bunke, Horst
ISSN:	0262-8856
Publisher:	Elsevier
Language:	English
Submitter:	Factscience Import
Date Deposited:	04 Oct 2013 15:22
Last Modified:	05 Dec 2022 14:25
Publisher DOI:	10.1016/j.imavis.2008.04.004
Web of Science ID:	000266393300012
URI:	https://boris.unibe.ch/id/eprint/37076 (FactScience: 206708)