This paper develops an automatic procedure for the optimal numbering of members and nodes in tree structures. With it the stiffness matrix is optimally conditioned either if a direct solution algorithm or a frontal one is used to solve the system of equations. In spite of its effectiveness, the procedure is strikingly simple and so is the computer program shown below
The subtrees of a tree have been studied from various points of view. In particular, the extremal tr...
We consider the problem of computing the Maximum Agreement Subtree (MAST) of a set of rooted leaf la...
AbstractThe analysis of many algorithms concerning trees requires the enumeration of families of nod...
This paper develops an automatic procedure for the optimal numbering of members and nodes in tree st...
A number of basic results concerning tree optimization problems are presented. As well as treating t...
An optimal element numbering of a pipeline system containing rings is considered. In order to minimi...
The tree structures are getting more and more important in the modern computer systems. Especially i...
M.Sc. (Computer Science)Chapter 1 is a summary in which the problems- discussed in this study, as we...
AbstractIn this paper, various optimality problems (such as the shortest route, most reliable route ...
The mathematical formulation of the decomposition problem is the aim of the paper as well as the inv...
The min-rank of a graph was introduced by Haemers (Algebr. Methods Graph Theory 25:267–272, 1978) to...
AbstractThe reinforcement number of a graph is the smallest number of edges that have to be added to...
The min-rank of a graph was introduced by Haemers (1978) to bound the Shannon capacity of a graph. T...
AbstractA graph describes the zero–nonzero pattern of a family of matrices, with the type of graph (...
Given a tree, finding an optimal node ranking and finding an optimal edge ranking are interesting co...
The subtrees of a tree have been studied from various points of view. In particular, the extremal tr...
We consider the problem of computing the Maximum Agreement Subtree (MAST) of a set of rooted leaf la...
AbstractThe analysis of many algorithms concerning trees requires the enumeration of families of nod...
This paper develops an automatic procedure for the optimal numbering of members and nodes in tree st...
A number of basic results concerning tree optimization problems are presented. As well as treating t...
An optimal element numbering of a pipeline system containing rings is considered. In order to minimi...
The tree structures are getting more and more important in the modern computer systems. Especially i...
M.Sc. (Computer Science)Chapter 1 is a summary in which the problems- discussed in this study, as we...
AbstractIn this paper, various optimality problems (such as the shortest route, most reliable route ...
The mathematical formulation of the decomposition problem is the aim of the paper as well as the inv...
The min-rank of a graph was introduced by Haemers (Algebr. Methods Graph Theory 25:267–272, 1978) to...
AbstractThe reinforcement number of a graph is the smallest number of edges that have to be added to...
The min-rank of a graph was introduced by Haemers (1978) to bound the Shannon capacity of a graph. T...
AbstractA graph describes the zero–nonzero pattern of a family of matrices, with the type of graph (...
Given a tree, finding an optimal node ranking and finding an optimal edge ranking are interesting co...
The subtrees of a tree have been studied from various points of view. In particular, the extremal tr...
We consider the problem of computing the Maximum Agreement Subtree (MAST) of a set of rooted leaf la...
AbstractThe analysis of many algorithms concerning trees requires the enumeration of families of nod...
DOI
Add to ORKG