Line Graphs
Mostrando 1-12 de 14 artigos, teses e dissertações.
-
1. Estudo de casos de complexidade de coloraÃÃes gulosa de vÃrtices e de arestas / Case studies of complexity of greedy colorings of vertices and edges
Os problemas de colorac Ëao de vÂertices e de arestas, que consistem em determinar o menor nÂumero de cores necessÂarias para colorir os vÂertices e arestas de um grafo, respectivamente, de forma que vÂertices adjacentes e arestas adjacentes, respectivamente, possuem cores distintas, sËao problemas computacionalmente difÂıceis e sËao objeto d
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 07/04/2011
-
2. Arranjos Log-Periódicos Compactos em Microfita com Elementos Fractais de Koch / Arranjos Log-Periódicos Compactos em Microfita com Elementos Fractais de Koch
This work aims to present how the application of fractal geometry to the elements of a log-periodic array can become a good alternative when one wants to reduce the size of the array. Two types of log-periodic arrays were proposed: one with fed by microstrip line and other fed by electromagnetic coupling. To the elements of these arrays were applied fractal
Publicado em: 2010
-
3. Estudo da interação de paredes de alvenaria estrutural com a estrutura de fundação
This dissertation presents a study of factors that influence the soil-structure interaction mechanism in buildings and their implications on the behavior of them. Firstly, an extensive bibliographical review was made, and this study broached the main concepts of the SSI research field, such as constitutive models of soil, discrete models to represent soil, s
Publicado em: 2010
-
4. Sobre Conjuntos Dominantes Eficientes em Grafos / On the Efficient Dominating Sets in Graphs
Given a graph G = (V;E) and a set of vertices D V, a vertice v 2 V is dominated by D if jN[v] Dj 1. When jN(v) Dj = 1 for all v 2 V, G is efficiently dominable. A generalization of this concept is called efficient multiple domination, which requires all vertices must be dominated by a set D V exactly k times. The aim of this dissertation is to study these to
Publicado em: 2009
-
5. Leitura e interpretação de gráficos e tabelas: um estudo exploratório com alunos da 8 série do ensino fundamental
The purpose of this dissertation was to investigate the development of reading, comprehension of tables and graphs and the concept of arithmetic mean with students from 8th grade, in order to offer relevant data to answer the following research question: What are the effects from the point of view of application and development that a teaching intervention b
Publicado em: 2007
-
6. Contribuição à análise da capacidade de processamento de trens cargueiros em linhas ferroviárias singelas no Brasil / Contribution to analysis of process capacity of cargo trains on single track railroad line in Brazil
The expessive growth of the railway sector due to the privatization of the operations since 1996, is increasing the participation of this mode in the brazilian transport matrix. However, this growth is obtained mainly from the replacement and increase of the rolling stock and the modernization of the traffic control system, and will soon reach some important
Publicado em: 2006
-
7. RepresentaÃÃo de sistemas dinÃmicos simbÃlicos de memÃria finita usando grafos / Reprentations of shifts of finite type using graphs
Nesta dissertaÃÃo empregamos a teoria de dinÃmica simbÃlica como ferramenta matemÃtica para abordar o problema da representaÃÃo de seqÃÃncias de sÃmbolos que podem ser modeladas por sistemas dinÃmicos simbÃlicos de memÃria finita. Utilizando teoria de autÃmatos, apresentamos novos algoritmos para gerar grafos determinÃsticos com um nÃmero mÃ
Publicado em: 2006
-
8. Modelagem e identificaÃÃo de uma mÃquina de extrusÃo atravÃs de bond-graphs.
Este trabalho tem como objetivo a modelagem por grafo de ligaÃÃo (Bond Graph) de uma mÃquina de extrusÃo de borracha para pneumÃticos e a identificaÃÃo experimental dos parÃmetros do modelo BG. Esta modelagem possibilita modelos contÃnuos no espaÃo de estados que podem ser convertidos para modelos contÃnuos em funÃÃo de transferÃncia. A metodol
Publicado em: 2005
-
9. Treino em esteira com suporte parcial de peso associado à estimulação elétrica funcional melhora a marcha de hemiparéticos crônicos e efeitos da inclinação da esteira na marcha de sujeitos hemiparéticos.
The purpose of this study was to evaluate the effect of the combined use of functional electrical stimulation (FES) and treadmill training with body weight support (BWS) in walking functions and voluntary limb control in chronic hemiparetic patients. Eight hemiparetic individuals (mean age, 56.6 10.26 years) were evaluated in the present clinical trial. The
Publicado em: 2005
-
10. Um modelo de hipertexto para apoio ao ensino mediado pela Web / A hypertext model to support Web-mediated teaching
There is an increasing demand for hypermedia applications based on the WWW (World Wide Web), known as Web Information Systems (WIS). These applications present specific requirements in addition to those of traditional software systems, thus fostering the need for investigating suitable models to support their development. In particular, systems for Distance
Publicado em: 2003
-
11. Enumeration of structure-sensitive graphical subsets: Calculations
Numerical calculations are presented, for all connected graphs on six and fewer vertices, of the numbers of independent sets, connected sets, point and line covers, externally stable sets, kernels, and irredundant sets. With the exception of the number of kernels, the numbers of such sets are all highly structure-sensitive quantities.
-
12. Integrated transcriptome analysis of the cellular mechanisms associated with Ha-ras-dependent malignant transformation of the human breast epithelial MCF7 cell line
To understand the cellular mechanisms of malignant transformation induced by constitutive activation of the ras oncogene (Ha-ras), we used a subtractive hybridization method (VGID™) together with an integrative analytical procedure based upon literature databases in the form of extensive interaction graphs. We found 166 over- and under-expressed genes whic
Oxford University Press.