Minimum spanning table and optimal expansion of competence set (Q1969528)

Each directed graph with asymmetric costs over its arcs can be represented by a table (matrix) called an expansion table. An expansion table is a spanning table if the corresponding directed graph is a tree spanning over each node of the graph. After decribing properties of the spanning tables an algorithm to find a minimum spanning table in a given expansion table is given in the paper. This algorithm is applied to find an optimal expansion process for competence sets (the competence set is an adequate set of skills for solving a problem or a set of problems). Two cases are considered: (1) expansion from skills to skills and (2) expansion from compound skills to other skills.