"Graph Matching Networks Meet Optimum-Path Forest: How to Prune Ensembles ..."

Danilo Samuel Jodas et al. (2024)

> Home

Details and statistics

DOI: 10.1007/978-3-031-78183-4_1

access: closed

type: Conference or Workshop Paper

metadata version: 2024-12-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/icpr/JodasPRCP24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icpr/JodasPRCP24
Danilo Samuel Jodas, Leandro A. Passos, Douglas Rodrigues, Kelton A. P. Costa, João Paulo Papa:
Graph Matching Networks Meet Optimum-Path Forest: How to Prune Ensembles Efficiently. ICPR (7) 2024: 1-18

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.