An efficient algorithm for a special case of the set partition problem

DOI10.1080/00207169008803858MaRDI QIDQ3477962zbMATH OpenOpenAlexFDO

Authors Alan Jackson, Prakash V. Ramanan

Publication date 1990

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

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

zbMATH Keywords

minimizationdecision treedeterministic finite automatonSet Partition Problem

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Recommendations

• An set refinement algorithm with applications
• A Fast Algorithm for Generating Set Partitions
• An efficient parallel algorithm for the single function coarsest partition problem
• The parallel complexity of coarsest set partition problems
• scientific article; zbMATH DE number 3860390

Cites work

• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• A linear time solution to the single function coarsest partition problem

Cited in

(11)

• A relax-and-cut algorithm for the set partitioning problem
• Graph-Theoretic Concepts in Computer Science
• A sequential aggregation algorithm for the set partitioning problem
• A linear-time algorithm for a special case of disjoint set union
• scientific article; zbMATH DE number 5812481 (Why is no real title available?)
• A hybrid exact algorithm for complete set partitioning
• scientific article; zbMATH DE number 5492159 (Why is no real title available?)
• An algorithm for partitioning a set into simple parts
• Algorithms for constructing the shortest allowable partitions of finite sets
• Optimal Set Partitioning
• An set refinement algorithm with applications

This page was built for publication: An efficient algorithm for a special case of the set partition problem

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