Trees - Open Access .click

Results 281 to 290 of about 919,373 (313)

Some of the next articles are maybe not open access.

International Journal of Pattern Recognition and Artificial Intelligence, 1988
This paper describes the computing alogrithms for the tree distance based on the structure preserving mapping. The distance is defined as the minimum sum of the weights of edit operations needed to transform tree Tα to tree Tβ under restriction of the structure preserving mapping.
Eiichi Tanaka, Keiko Tanaka
openaire +1 more source

Tree polytope on 2-trees

Mathematical Programming, 1994
The class of 2-tree graphs is defined inductively as follows: start with a single edge and add nodes by joining them to the two endpoints of an existing edge. Many NP-complete problems on graphs are polynomial when restricted to this class of graphs. In particular, the Steiner Tree problem is linear time solvable on graphs in this class.
François Margot, Alain Prodon, Thomas M. Liebling +2 more
openaire +1 more source

Trees and Tree-Equivalent Graphs

Canadian Journal of Mathematics, 1965
As is well known in the theory of graphs a tree is a connected graph without cycles. Many characterizing properties of trees are known (1), for example the cyclomatic number is equal to zero, which is also equal to p — 1, where p is the number of connected components of the graph.
openaire +2 more sources

Biopolymers Derived from Trees as Sustainable Multifunctional Materials: A Review

Advanced Materials, 2021
Chao Liu, Pengcheng Luan, Qiang Li
exaly

To Tree or Not to Tree?