Skip Navigation

The Computer Journal 1979 22(2):110-113; doi:10.1093/comjnl/22.2.110
© 1979 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (1)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Mavaddat, F.
Right arrow Articles by Parhami, B.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A data structure for family relations

F. Mavaddat * and B. Parhami *

Department of Mathematics and Computer Science, Arya-Mehr University of Technology, Tehran, Iran

A data structure is proposed which enables efficient determination of family relations of common interest with the minimum amount of information on each individual. The problem of updating information due to births, deaths, marriages and divorces is considered. Algorithms for determining the immediate relatives of each individual are given and a framework is established for writing procedures to determine other relatives.

Received June 1977.

* Department of Mathematics and Computer Science, Arya-Mehr University of Technology, Tehran, Iran


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.