An algorithm for partitioning a set into simple parts

DOI10.1007/S11086-005-0038-0zbMATH Open1106.68026OpenAlexW2087777475MaRDI QIDQ2498282FDOQ2498282

Authors: L. Ya. Savel'ev 

Publication date: 16 August 2006

Published in: Programming and Computer Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11086-005-0038-0

Recommendations

• scientific article; zbMATH DE number 3976788
• scientific article; zbMATH DE number 3903779
• A Fast Algorithm for Generating Set Partitions
• An efficient algorithm for a special case of the set partition problem
• Publication:4953911
• Partitioning a finite set by a dynamic programming method
• scientific article; zbMATH DE number 139923
• An algorithm for nontransitive partitions
• Set partitioning via inclusion-exclusion

zbMATH Keywords

data miningstructural analysis of abstract data

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Data structures (68P05)

Cites Work

• Title not available (Why is that?)

Cited In (3)

• Graph-Theoretic Concepts in Computer Science
• Title not available (Why is that?)
• A Simple SVD Algorithm for Finding Hidden Partitions

This page was built for publication: An algorithm for partitioning a set into simple parts

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