"Finding Maximum Common Subgraphs Efficiently Through Dynamic Bidirectional ..."

Yicheng Hu, Xibo Sun, Qiong Luo (2025)

> Home

Details and statistics

DOI: 10.1007/978-981-95-5719-6_3

access: closed

type: Conference or Workshop Paper

metadata version: 2026-02-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/apweb/HuSL25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/apweb/HuSL25
Yicheng Hu, Xibo Sun, Qiong Luo:
Finding Maximum Common Subgraphs Efficiently Through Dynamic Bidirectional Vertex Selection. APWeb-WAIM (3) 2025: 34-50

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.