Skip to main content
Journal Article

A generic program for minimal subsets with applications

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2003) 2664 144-157
DOI: 10.1007/3-540-45013-0_12
3Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We formally develop a generic program which computes a minimal subset satisfying a certain property of a given set. To improve the efficiency of instantiations, refinements are investigated. Finally, instantiations are presented which correspond to the solution of well-known graph-theoretic problems and some further applications are sketched. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Berghammer, R. (2003). A generic program for minimal subsets with applications. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2664, 144–157. https://doi.org/10.1007/3-540-45013-0_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free