"G2S: A Greedy Node Swapping Algorithm to Compute Upper Bound Graph Edit ..."

Yilei He et al. (2025)

> Home

Details and statistics

DOI: 10.1109/IJCNN64981.2025.11229420

access: closed

type: Conference or Workshop Paper

metadata version: 2025-12-07

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/ijcnn/HePZKHZ25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ijcnn/HePZKHZ25
Yilei He, Jiansu Pu, Derui Zhong, Dejing Ke, Jinyue Huang, Yanlin Zhu:
G2S: A Greedy Node Swapping Algorithm to Compute Upper Bound Graph Edit Distance. IJCNN 2025: 1-8

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.