Trees Graph Theory
Mostrando 1-6 de 6 artigos, teses e dissertações.
-
1. Árvores de Steiner: Teoria, Geração Numérica e Aplicações / Steiner trees: Theory, Numerical Generation and Applications
Given a set of points in the plane, which we call terminals, one proves that they are always connected by a minimal graph called Steiner tree. The terminals may represent main connection route points, circuit elements or network computer servers. That is, the problem is to optimize traffic among the terminals whenever this is represented by a tree of shortes
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 16/12/2009
-
2. inexact graph correspondence / Correspondência inexata entre grafos.
Let GI = (VI ,AI) and GM = (VM,AM) be two simple graphs. A mapping from GI to GM is an association set, such that each vertex in VI is associated to a vertex in VM, and each edge in AI is associated to a pair of vertices of VM. A cost is defined to each possible association. The inexact graph correspondence problem (IGCP) consists in finding a mapping from G
Publicado em: 2008
-
3. Algoritmos Paralelos para Extensão Linear em Digrafos Planares
This work main objective was to study and to detail a PRAM parallel algorithm to compute topological ordering of a planar acyclic digraph, proposed by Kao and Klein. It is not trivial to obtain a topological ordering of general acyclic digraphs. Kao and Klein showed that this ordering can only be achieved computing the digraph transitive closure. Concerning
Publicado em: 2006
-
4. Reflexões e numero de cobertura de arvores homogeneas e grupos de automorfismos de arvores semi-homogeneas
Let G be a homogeneous tree and Aut(G) its group of automorphism. An automorphism Î Aut(G) is said to be even if d(f(x),x) º0 mod 2 for every vertex x Î G of , where d(.,.) is the canonical distance function defined by the minimum length of paths connecting the vertices. The set Aut+(G) of all even automorphism is a subgroup of index 2 in Aut(G). We defin
Publicado em: 2006
-
5. MIST: Maximum Information Spanning Trees for dimension reduction of biological data sets
Motivation: The study of complex biological relationships is aided by large and high-dimensional data sets whose analysis often involves dimension reduction to highlight representative or informative directions of variation. In principle, information theory provides a general framework for quantifying complex statistical relationships for dimension reduction
Oxford University Press.
-
6. Exploring the repertoire of RNA secondary motifs using graph theory; implications for RNA design
Understanding the structural repertoire of RNA is crucial for RNA genomics research. Yet current methods for finding novel RNAs are limited to small or known RNA families. To expand known RNA structural motifs, we develop a two-dimensional graphical representation approach for describing and estimating the size of RNA’s secondary structural repertoire, inc
Oxford University Press.