| Full text | |
| Author(s): |
Ferreira, Carlos E.
;
Franco, Alvaro J. P.
;
da Silva, Marcio F.
;
IEEE
Total Authors: 4
|
| Document type: | Journal article |
| Source: | 2014 IEEE 10TH INTERNATIONAL CONFERENCE ON E-SCIENCE (E-SCIENCE), VOL 1; v. N/A, p. 8-pg., 2014-01-01. |
| Abstract | |
We consider the problem of deciding the existence of matrimonial circuits, and finding implexa in kinship networks. These networks can be modeled by acyclic digraphs. A matrimonial circuit can be seen as vertex-disjoint directed paths from special starting to special ending vertices of these acyclic digraphs. An implex is the set of all matrimonial circuits of a given pair of special vertices. We present methods based on Eppstein's reduction [3] and algorithms for finding junctions [5] to decide the existence of matrimonial circuits. The efficiency of these methods is shown in our empirical results on seven Amerindian kinship networks. To enumerate all implexa, we present an algorithm, given that the kinship network is limited. We present some descriptive statistics which help us to justify the good performance of the methods. We incorporate to our software tool, the Kinship Machine [2], a feature to enumerate matrimonial circuits. This tool is being used by Anthropologists to analyze Amerindian kinship networks of northern Brazil. (AU) | |
| FAPESP's process: | 08/53352-3 - The union of marriage in tropical South America: study of two empirical networks |
| Grantee: | Marcio Ferreira da Silva |
| Support Opportunities: | Regular Research Grants |
| FAPESP's process: | 13/03447-6 - Combinatorial structures, optimization, and algorithms in theoretical Computer Science |
| Grantee: | Carlos Eduardo Ferreira |
| Support Opportunities: | Research Projects - Thematic Grants |