A generic program for minimal subsets with applications

Authors:
Rudolf Berghammer
Affiliations:
Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität Kiel, Kiel, Germany
Venue:
LOPSTR'02 Proceedings of the 12th international conference on Logic based program synthesis and transformation
Year:
2002

Citing 8
Cited 2

Introduction to algorithms

Introduction to algorithms
An exact characterization of greedy structures

SIAM Journal on Discrete Mathematics
Approximating the Minimum Equivalent Digraph

SIAM Journal on Computing
Approximation algorithms for NP-hard problems

Approximation algorithms for NP-hard problems
Efficient Planarity Testing

Journal of the ACM (JACM)
A Discipline of Programming

A Discipline of Programming
On the Refinement Calculus

On the Refinement Calculus
Realtion-Algebraic Analysis of Petri Nets with RELVIEW

TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems

Relational implementation of simple parallel evolutionary algorithms

RelMiCS'05 Proceedings of the 8th international conference on Relational Methods in Computer Science, Proceedings of the 3rd international conference on Applications of Kleene Algebra
Evaluating sets of search points using relational algebra

RelMiCS'06/AKA'06 Proceedings of the 9th international conference on Relational Methods in Computer Science, and 4th international conference on Applications of Kleene Algebra

Quantified Score

Hi-index	0.00

Visualization

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.