"Seeded graph matching: Efficient algorithms and theoretical guarantees."

Farhad Shirani, Siddharth Garg, Elza Erkip (2017)

> Home

Details and statistics

DOI: 10.1109/ACSSC.2017.8335178

access: closed

type: Conference or Workshop Paper

metadata version: 2022-10-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/acssc/ShiraniGE17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/acssc/ShiraniGE17
Farhad Shirani, Siddharth Garg, Elza Erkip:
Seeded graph matching: Efficient algorithms and theoretical guarantees. ACSSC 2017: 253-257

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.