Riesen, Kaspar; Neuhaus, Michel; Bunke, Horst (2007). Bipartite graph matching for computing the edit distance of graphs. 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. 1-12). Heidelberg: Springer Verlag 10.1007/978-3-540-72903-7_1
![[img]](https://boris.unibe.ch/style/images/fileicons/text.png) |
Text
978-3-540-72903-7_1.pdf - Published Version Restricted to registered users only Available under License Publisher holds Copyright. Download (443kB) | Request a copy |
Official URL: http://dx.doi.org/10.1007/978-3-540-72903-7_1
Item Type: |
Conference or Workshop Item (Paper) |
|---|---|
Division/Institute: |
08 Faculty of Science > Institute of Computer Science (INF) |
UniBE Contributor: |
Neuhaus, Michel, Bunke, Horst |
ISBN: |
978-3-540-72902-0 1- |
Series: |
Lecture Notes in Computer Science |
Publisher: |
Springer Verlag |
Language: |
English |
Submitter: |
Factscience Import |
Date Deposited: |
04 Oct 2013 15:01 |
Last Modified: |
24 May 2023 12:07 |
Publisher DOI: |
10.1007/978-3-540-72903-7_1 |
Web of Science ID: |
000247365900001 |
BORIS DOI: |
10.48350/26485 |
URI: |
https://boris.unibe.ch/id/eprint/26485 (FactScience: 72120) |
Actions (login required)
 |
Edit item |