Skip to main content
SpringerLink
Log in

An Algorithm for Partitioning a Set into Simple Parts

  • Published:
Programming and Computer Software Aims and scope Submit manuscript

Abstract

The paper describes a method for the structural analysis of abstract data and its applications. A finite set with two numberings, two order relations, and one symmetry relation is considered. An algorithm is proposed for partitioning this set into simple parts determined by compositions of given relations. Each simple part of the set is then partitioned into layers. This model can also be used for analyzing different data admitting similar formalization. It can be used for analyzing structure of some graphs (in particular, graphs describing molecular associations). The proposed algorithms are used for partitioning a complex family into simple ones determined by family relationships and for determining family generations. The algorithms can be applied to analyzing corporations with a family-like structure.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

REFERENCES

  1. Duke, V.A. and Samoilenko, A.P., Data Mining (Data Mining), St. Petersburg: BHV, 2001.

    Google Scholar 

  2. Knuth, D.E., The Art of Computer Programming, vol. 3, Reading: Addison-Wesley, 1973. Translated under the title Iskusstvo programmirovaniya dlya EVM, vol. 3, Moscow: Mir, 1978.

    Google Scholar 

  3. Goncharova, G.S. and Savel'ev, L.Ya., Strukturnye kharakteristiki semei (Structural Characteristics of Families), Novosibirsk, 2002.

  4. Roberts, F.S., Discrete Mathematical Models with Applications to Social, Biological, and Environmental Problems, Englewood Cliffs: Prentice-Hall, 1976. Translated under the title Diskretnye matematicheskie modeli s prilozheniyami k sotsial'nym, biologicheskim i ekologicheskim zadacham, Moscow: Nauka, 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Novosibirsk State University, ul. Pirogova 2, Novosibirsk, 630090, Russia

    L. Ya. Savel'ev

Authors
  1. L. Ya. Savel'ev
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

__________

Translated from Programmirovanie, Vol. 31, No. 6, 2005.

Original Russian Text Copyright © 2005 by Savel'ev.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Savel'ev, L.Y. An Algorithm for Partitioning a Set into Simple Parts. Program Comput Soft 31, 293–300 (2005). https://doi.org/10.1007/s11086-005-0038-0

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11086-005-0038-0

Keywords

Search

Navigation