Login / Signup

Approximating the maximum common subgraph isomorphism problem with a weighted graph.

Alan Chia-Lung ChenAhmad ElhajjShang GaoAbdullah SarhanSalim AfraAhmad KassemReda Alhajj
Published in: Knowl. Based Syst. (2015)
Keyphrases
  • weighted graph
  • subgraph isomorphism
  • maximum common subgraph
  • shortest path
  • graph model
  • graph partitioning
  • edge weights
  • graph structure
  • spanning tree
  • data objects
  • np hard
  • graphical models
  • graph databases