Speeding up Graph Edit Distance Computation through Fast Bipartite Matching

Kurzanzeige
dc.accessRightsAnonymous
dc.audienceWissenschaft
dc.contributor.authorFankhauser, Stefan
dc.contributor.authorRiesen, Kaspar
dc.contributor.authorBunke, Horst
dc.contributor.editorJiang, Xiaoyi
dc.contributor.editorFerrer, Miquel
dc.contributor.editorTorsello, Andrea
dc.date.accessioned2015-10-05T15:41:28Z
dc.date.available2015-10-05T15:41:28Z
dc.date.issued2011
dc.eventProceedings 8th International Workshop on Graph Based Representations in Pattern Recognition
dc.identifier.urihttp://hdl.handle.net/11654/9192
dc.language.isoen_UK
dc.relation.ispartofProceedings 8th International Workshop on Graph Based Representations in Pattern Recognition
dc.subject.ddc330 - Wirtschaft
dc.subject.ddc005 - Computer Programmierung, Programme und Daten
dc.titleSpeeding up Graph Edit Distance Computation through Fast Bipartite Matching
dc.type04B - Beitrag Konferenzschrift
dspace.entity.typePublication
fhnw.InventedHereunbekannt
fhnw.ReviewTypeAnonymous ex ante peer review of a complete publication
fhnw.affiliation.hochschuleHochschule für Wirtschaftde_CH
fhnw.affiliation.institutInstitut für Wirtschaftsinformatikde_CH
fhnw.pagination102-111
fhnw.publicationStatePublished
relation.isAuthorOfPublication248b80d5-441f-4da9-8252-07ea0e7abe9f
relation.isAuthorOfPublicationd761e073-1612-4d22-8521-65c01c19f97a
relation.isAuthorOfPublication.latestForDiscoveryd761e073-1612-4d22-8521-65c01c19f97a
Dateien
Sammlung
Institut für Wirtschaftsinformatik