Speeding up Graph Edit Distance Computation with a Bipartite Heuristic

Riesen, Kaspar; Fankhauser, Stefan; Bunke, Horst (2007). Speeding up Graph Edit Distance Computation with a Bipartite Heuristic. In: Frasconi, Paolo; Kersting, Kristian; Tsuda, Koji (eds.) MLG 2007. Mining and Learning with Graphs, Università degli Studi di Firenze, Aug. 1-3, 2007 (pp. 21-24). Verlag fehlt

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:

Riesen, Kaspar and Bunke, Horst

Publisher:

Verlag fehlt

Language:

English

Submitter:

Factscience Import

Date Deposited:

04 Oct 2013 15:01

Last Modified:

04 May 2014 23:18

URI:

https://boris.unibe.ch/id/eprint/26466 (FactScience: 72061)

Actions (login required)

Edit item Edit item
Provide Feedback