Finding Matrimonial Circuits in some AmerindianKinship Networks
Finding Matrimonial Circuits in some AmerindianKinship Networks We consider the problem of deciding the existenceof matrimonial circuits, and finding implexa in kinship networks.These networks can be modeled by acyclic digraphs. A mat-rimonial circuit can be seen as vertex-disjoint directed pathsfrom special starting to special ending vertices of these acyclicdigraphs. An implex is the set of […]
Finding Matrimonial Circuits in some AmerindianKinship Networks Read More »