Sub-optimal Graph Matching by Node-to-Node Assignment Classification

Xavier Cortés, Donatello Conte, Francesc Serratosa

Open source

DOI
10.1007/978-3-030-20081-7_4
Published
2019
Container
Lecture Notes in Computer Science
Publisher
Springer International Publishing
Open access
unknown

Credibility signals

uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.1007/978-3-030-20081-7_4,
  title = {Sub-optimal Graph Matching by Node-to-Node Assignment Classification},
  author = {Xavier Cortés and Donatello Conte and Francesc Serratosa},
  year = {2019},
  journal = {Lecture Notes in Computer Science},
  doi = {10.1007/978-3-030-20081-7_4},
  url = {https://doi.org/10.1007/978-3-030-20081-7_4}
}

RIS

TY  - JOUR
TI  - Sub-optimal Graph Matching by Node-to-Node Assignment Classification
AU  - Xavier Cortés
AU  - Donatello Conte
AU  - Francesc Serratosa
PY  - 2019
JO  - Lecture Notes in Computer Science
DO  - 10.1007/978-3-030-20081-7_4
UR  - https://doi.org/10.1007/978-3-030-20081-7_4
ER  - 

APA

Cortés, X., Conte, D., & Serratosa, F. (2019). Sub-optimal Graph Matching by Node-to-Node Assignment Classification. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-030-20081-7_4

Source records