• Combining Bipartite Graph Matching and Beam Search for Graph Edit Distance Approximation 

      Riesen, Kaspar; Fischer, Andreas; Bunke, Horst (2014)
      Artificial Neural Networks in Pattern Recognition - 6th IAPR TC 3 International Workshop, ANNPR 2014, Montreal, QC, Canada, October 6-8, 2014, Proceedings
      Graph edit distance (GED) is a powerful and flexible graph dissimilarity model. Yet, exact computation of GED is an instance of a quadratic assignment problem and can thus be solved in exponential time complexity only. A ...
      04B - Beitrag Konferenzschrift
    • Computing Upper and Lower Bounds of Graph Edit Distance in Cubic Time 

      Riesen, Kaspar; Fischer, Andreas; Bunke, Horst (2014)
      Artificial Neural Networks in Pattern Recognition - 6th IAPR TC 3 International Workshop, ANNPR 2014, Montreal, QC, Canada, October 6-8, 2014. Proceedings
      Exact computation of graph edit distance (GED) can be solved in exponential time complexity only. A previously introduced approximation framework reduces the computation of GED to an instance of a linear sum assignment ...
      04B - Beitrag Konferenzschrift
    • Kernel k-means Clustering applied to Vector Space Embeddings of Graphs 

      Riesen, Kaspar; Bunke, Horst (2008)
      Artificial Neural Networks in Pattern Recognition. Third IAPR TC3 Workshop, ANNPR 2008 Paris, France, July 2-4, 2008, Proceedings
      04B - Beitrag Konferenzschrift
    • Suboptimal Graph Edit Distance Based on Sorted Local Assignments 

      Riesen, Kaspar; Ferrer, Miquel; Bunke, Horst (2015)
      Multiple Classifier Systems - 12th International Workshop, MCS 2015, Günzburg, Germany, June 29 - July 1, 2015
      Graph based pattern representation offers a number of useful properties. In particular, graphs can adapt their size and complexity to the actual pattern, and moreover, graphs are able to describe structural relations that ...
      04B - Beitrag Konferenzschrift