Fingerprint Template Compression by Solving a Minimum Label k-Node Subtree Problem

DOI10.1063/1.2790174MaRDI QIDQ5504425zbMATH OpenOpenAlexFDO

Authors Günther R. Raidl, Andreas M. Chwatal

Publication date 22 January 2009

Published in AIP Conference Proceedings (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1063/1.2790174

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to combinatorics (05-04) Graph theory (05C99) Authentication, digital signatures and secret sharing (94A62)

Cited in

(1)

• Solving a k-node minimum label spanning arborescence problem to compress fingerprint templates

This page was built for publication: Fingerprint Template Compression by Solving a Minimum Label k-Node Subtree Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5504425)