An algorithm to minimize representations of finite order relations

DOI10.1080/00207169208804034MaRDI QIDQ3989773zbMATH OpenOpenAlexFDO

Authors Camino R. Vela, Antonio Bahamonde

Publication date 28 June 1992

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207169208804034

zbMATH Keywords

automataorder relationsminimal realizationrepresentationscoop minimization

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On optimal approximations of arbitrary relations by partial orders
• Solving Algorithmic Problems on Orders and Lattices by Relation Algebra and RelView
• The best nondeterministic representations of finite orderings.
• AN ALGORITHMIC METHOD TO COMPUTE A MINIMAL RELATION FOR ANY NUMERICAL SEMIGROUP
• An Approximate Minimum Degree Ordering Algorithm
• Efficient Algorithms for Description Problems over Finite Totally Ordered Domains
• Approximations of arbitrary relations by partial orders
• Computing minimal extending sets by relation-algebraic modeling and development
• An algorithm for computing primitive relations
• Exact computation of minimum feedback vertex sets with relational algebra

Cites work

• scientific article; zbMATH DE number 3549200 (Why is no real title available?)
• Cost functors and optimal realization
• Fuzzy machines in a category
• Machines in a Category: An Expository Introduction

Cited in

(4)

• The best nondeterministic representations of finite orderings.
• Ordered structures for parallel rule-based computations
• Algebraic relation of three MinRank algebraic modelings
• Inductive properties of lattices

This page was built for publication: An algorithm to minimize representations of finite order relations

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