The Shortest Kinship Description Problem∗
نویسندگان
چکیده
We consider a problem in descriptive kinship systems, namely finding the shortest sequence of terms that describes the kinship between a person and his/her relatives. The problem reduces to finding the minimum weight path in a labeled graph where the label of the path comes from a regular language. The running time of the algorithm is O(n3 + s), where n and s are the input size and the output size of the algorithm, respectively. To the memories of Jiaqi Zhao(1994-2016).
منابع مشابه
Shortest Kinship Description Problem∗
We consider a problem in descriptive kinship systems, namely finding the shortest sequence of terms that describes the kinship between a person and their relatives. The problem reduces to finding the minimum weight path in a labeled graph where the label of the path comes from a regular language. The running time of the algorithm is O(n3 + s), where n and s is the input size and the output size...
متن کاملRepresenting Kinship Relations on the Semantic Web
Kinship plays a fundamental role in human communities as a basic principle for organizing individuals into social groups. Representing kinship relationships in a formal and precise way is then a crucial task when modelling many knowledge domains, and it may constitute a relevant benchmark for the reasoning layer of the Semantic Web. In this paper we face the problem of representing some basic a...
متن کاملA New Algorithm for the Discrete Shortest Path Problem in a Network Based on Ideal Fuzzy Sets
A shortest path problem is a practical issue in networks for real-world situations. This paper addresses the fuzzy shortest path (FSP) problem to obtain the best fuzzy path among fuzzy paths sets. For this purpose, a new efficient algorithm is introduced based on a new definition of ideal fuzzy sets (IFSs) in order to determine the fuzzy shortest path. Moreover, this algorithm is developed for ...
متن کاملTwo optimal algorithms for finding bi-directional shortest path design problem in a block layout
In this paper, Shortest Path Design Problem (SPDP) in which the path is incident to all cells is considered. The bi-directional path is one of the known types of configuration of networks for Automated Guided Vehi-cles (AGV).To solve this problem, two algorithms are developed. For each algorithm an Integer Linear Pro-gramming (ILP) is determined. The objective functions of both algorithms are t...
متن کاملApproximation Solutions for Time-Varying Shortest Path Problem
Abstract. Time-varying network optimization problems have tradition-ally been solved by specialized algorithms. These algorithms have NP-complement time complexity. This paper considers the time-varying short-est path problem, in which can be optimally solved in O(T(m + n)) time,where T is a given integer. For this problem with arbitrary waiting times,we propose an approximation algorithm, whic...
متن کامل