Minimum spanning table and optimal expansion of competence set (Q1969528): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Tomáš Cipra / rank | |||
Property / reviewed by | |||
Property / reviewed by: Tomáš Cipra / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A foundation for competence set analysis / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal expansion and design of competence sets with asymmetric acquiring costs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal competence set expansion using deduction graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3751390 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4274996 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3942977 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 14:28, 29 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Minimum spanning table and optimal expansion of competence set |
scientific article |
Statements
Minimum spanning table and optimal expansion of competence set (English)
0 references
29 May 2000
0 references
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.
0 references
competence set expansion
0 references
habitual domains
0 references
minimum spanning tree
0 references
spanning table
0 references
directed graph
0 references