Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Computing Optimal Assignments in Linear Time for Approximate Graph Matching."

Nils M. Kriege et al. (2019)

> Home

Details and statistics

DOI: 10.1109/ICDM.2019.00045

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/icdm/KriegeGB019
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icdm/KriegeGB019
Nils M. Kriege, Pierre-Louis Giscard, Franka Bause, Richard C. Wilson:
Computing Optimal Assignments in Linear Time for Approximate Graph Matching. ICDM 2019: 349-358

a service of

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.