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 10.1007/11815921_17
![[img]](https://boris.unibe.ch/style/images/fileicons/text.png) |
Text
11815921_17.pdf - Published Version Restricted to registered users only Available under License Publisher holds Copyright. Download (1MB) |
Official URL: http://dx.doi.org/10.1007/11815921_17
Item Type: |
Conference or Workshop Item (Paper) |
|---|---|
Division/Institute: |
08 Faculty of Science > Institute of Computer Science (INF) |
UniBE Contributor: |
Neuhaus, Michel, 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: |
24 May 2023 14:16 |
Publisher DOI: |
10.1007/11815921_17 |
Web of Science ID: |
000240075100017 |
BORIS DOI: |
10.48350/18726 |
URI: |
https://boris.unibe.ch/id/eprint/18726 (FactScience: 963) |
Actions (login required)
 |
Edit item |