Speeding up Graph Edit Distance Computation with a Bipartite Heuristic

dc.accessRightsAnonymous
dc.audienceSonstige
dc.contributor.authorRiesen, Kaspar
dc.contributor.authorFankhauser, Stefan
dc.contributor.authorBunke, Horst
dc.contributor.editorFrasconi, Paolo
dc.contributor.editorKersting, Kristian
dc.contributor.editorTsuda, Koji
dc.date.accessioned2015-10-05T15:41:48Z
dc.date.available2015-10-05T15:41:48Z
dc.date.issued2007
dc.identifier.urihttp://hdl.handle.net/11654/9352
dc.language.isoen_UK
dc.relation.ispartofProc. 5th Int. Workshop on Mining and Learning with Graphs
dc.subject.ddc330 - Wirtschaft
dc.subject.ddc005 - Computer Programmierung, Programme und Daten
dc.titleSpeeding up Graph Edit Distance Computation with a Bipartite Heuristic
dc.type04B - Beitrag Konferenzschrift
dspace.entity.typePublication
fhnw.InventedHereunbekannt
fhnw.ReviewTypeNo peer review
fhnw.affiliation.hochschuleHochschule für Wirtschaft FHNWde_CH
fhnw.affiliation.institutInstitut für Wirtschaftsinformatikde_CH
fhnw.pagination21-24
fhnw.publicationStatePublished
relation.isAuthorOfPublicationd761e073-1612-4d22-8521-65c01c19f97a
relation.isAuthorOfPublication248b80d5-441f-4da9-8252-07ea0e7abe9f
relation.isAuthorOfPublication.latestForDiscoveryd761e073-1612-4d22-8521-65c01c19f97a
Dateien