k-Node Minimum Label Spanning Arborescence Problem to Compress Fingerprint Templates.">k-Node Minimum Label Spanning Arborescence Problem to Compress Fingerprint Templates., dblp, computer science, bibliography, knowledge graph, author, editor, publication, conference, journal, book, thesis, database, collection, open data, bibtex">

default search action

combined dblp search
author search
venue search
publication search

ask others

"Solving a k-Node Minimum Label Spanning Arborescence Problem to ..."

Andreas M. Chwatal, Günther R. Raidl, Karin Oberlechner (2009)

> Home

Details and statistics

DOI: 10.1007/S10852-009-9109-1

access: closed

type: Journal Article

metadata version: 2017-05-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jmma/ChwatalRO09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jmma/ChwatalRO09
Andreas M. Chwatal, Günther R. Raidl, Karin Oberlechner:
Solving a k-Node Minimum Label Spanning Arborescence Problem to Compress Fingerprint Templates. J. Math. Model. Algorithms 8(3): 293-334 (2009)

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.