"More Interpretable Graph Similarity Computation via Maximum Common ..."

Zixun Lan et al. (2024)

> Home

Details and statistics

DOI: 10.1109/TKDE.2024.3387044

access: closed

type: Journal Article

metadata version: 2024-11-04

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tkde/LanHMM24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tkde/LanHMM24
Zixun Lan, Binjie Hong, Ye Ma, Fei Ma:
More Interpretable Graph Similarity Computation via Maximum Common Subgraph Inference. IEEE Trans. Knowl. Data Eng. 36(11): 6588-6599 (2024)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.