Algorithms In Graphs
Mostrando 13-24 de 40 artigos, teses e dissertações.
-
13. Algebraic formulation for modeling hop-by-hop multi-constrained routing algorithms. / Formulação algébrica para a modelagem de algoritmos de roteamento multi-restritivo hop-by-hop.
This work presents a new mathematical structure for paths algebra that allows the convergence analysis of hop-by-hop multi-constrained routing algorithms and, under the traffic engineering and quality of service perspectives in the Generalized Multiprotocol Label Switching (GMPLS) architecture, trustily ensures the aggregation of new routing metrics in a con
Publicado em: 2008
-
14. SAMPA (Systemn for Comparative Analysis of Metabolic PAthways) / SAMPA (System for Comparative Analysis of Metabolic PAthways) - uma comparação de vias metabólicas
The advent of genome sequencing technology and complete genome analysis has provided new data on prokaryote and eukaryote metabolic pathways. The comparative analysis of metabolic pathways from different organisms can help us understand inter and intra species organizational relationships. Having this in mind, this work focused on building a system that allo
Publicado em: 2008
-
15. Utilização de banco de dados ontológicos e análise de redes sociais de cidadãos em sistemas de governo eletrônico
In recent years the technological advances have allowed the improvement, streamlining processes, activities simplification and the establishment of new forms of communication between people. They also reached the government sphere and its activities, bringing benefits with respect to access information and enabling greater interaction between citizens throug
Publicado em: 2008
-
16. Algoritmos para problemas de grafos com incertezas / Algorithms for fuzzy graphs problems
The graph theory is an important area of mathematical programming, it has an important role in fields such as engineering and operational research. In particular, it provides the tools to tackle network problems (e.g. allocation, shortest path, maximum flow, etc), which have applications in several sub areas of engineering (e.g. telecommunications, transport
Publicado em: 2007
-
17. Modular decomposition of undirected graphs / Decomposição modular de grafos não orientados
A module of a graph is a non distinguishable subset of nodes, regarding the nodes adjacency. Let M denote any module of a graph G. If every module of G wich overlaps M either contains M or is included in it, M is called a strong module...Note: The complete abstract is available with the full electronic digital thesis or dissertations
Publicado em: 2007
-
18. Decomposition and width in tree of graphs to glide free of cycles induced pairs / DecomposiÃÃo e largura em Ãrvore de grafos planares livres de ciclos pares induzidos.
The definitions of tree decomposition and treewidth were introduced by Robertson and Seymour in their series of papers on graph minors, published during the nineties. It is known that many NP-hard problems can be polynomially solved if a tree decomposition of bounded treewidth is given. So, it is of interest to bound the treewidth of certain classes of graph
Publicado em: 2007
-
19. Algorithms for classification and partitioning in graphs / Algoritmos para problemas de classificação e particionamento em grafos
We present algorithms for combinatorial optimization NP-hard problems on classification and graph partitioning. The thesis concerns about theory and application and is guided by an approximation algorithms approach, complemented with heuristics and integer programming. We proposed good approximation factor algorithms as well as algorithms that find quality s
Publicado em: 2007
-
20. Escalonamento de aplicações paralelas: de clusters para grids
Different algorithms provide efficient scheduling of parallel applications on distributed and heterogeneous computational platforms, such as computational grids. Most scheduling algorithms for such environments require an application model represented by a directed acyclic graph (DAG), selecting tasks for execution according to their processing and communica
Publicado em: 2007
-
21. The gem data structure for n-dimensional maps / A estrutura de dados gema para representação de mapas n-dimensionais
Maps are subdivisions of topological spaces into simple regions, and triangulations are a specific kind of map wherein each element is a simplex (edge, triangle, tetrahedron, etc). In this work, we analyze the problem of representing the topology of triangulations and maps with arbitrary dimension. We study a representation based on edge-colored graphs, alre
Publicado em: 2007
-
22. Uma investigação sobre a aprendizagem do teorema fundamental do cálculo
This study aims to investigate the knowledge mobilized by students who have already studied the Fundamental Theorem of Calculus (FTC) regarding the concepts of differentiation and integration and its relationship. The FTC is one of the most important topic in any Calculus course according to Segadas (1998). The intention of the study is to evaluate if the mo
Publicado em: 2007
-
23. Complex network and self-organized criticality: models and applications / Rede complexa e criticalidade auto-organizada: modelos e aplicações
Models and scientific theories arise from the necessity of the human being to better understand how the world works. Driven by this purpose new models and techniques have been created. For instance, one of these theories recently developed is the Self-Organized Criticality, which is shortly introduced in the Chapter 2 of this thesis. In the framework of the
Publicado em: 2007
-
24. Orientações pfaffianas e o furtivo grafo de Heawood / Pfaffian orientations and the elusive Heawood graph
A graph G that contains a perfect matching is Pfaffiano if there is an orientation D of the edges of G, such that every conformal circuit of G is oddly oriented in D. A subgraph H of G is conformal if G - V (H) has a perfect matching. A circuit with an even number of edges is oddly oriented if the number of edges whose orientation in D agrees with any sense
Publicado em: 2006