Proof Graphs
Mostrando 1-12 de 12 artigos, teses e dissertações.
-
1. Convergent Sequences of Discrete Structures and Testability / SequÃncias Convergentes de Estruturas Discretas e Testabilidade
In this work, we studied the recent theory of convergent graph sequences and its extensions to permutation and partially ordered sets with fix dimension. Weâve conjectured a lemma of weak regularity on intervals that, if this conjecture is true, we can extend this theory to ordered graphs, which are graphs such that there is a total order on its vertices. W
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 27/02/2012
-
2. Hypersurfaces with prescribed mean curvature in Riemannian manifolds / HipersuperfÃcies com curvatura mÃdia prescrita em variedades riemannianas
This work shows results existence and uniqueness of graphs with prescribed mean curvature. We demonstrate that a natural fixation Dirichlet problem for graphs of average curvature is required to consider those graphs like leaves on a Riemannian submersion Killing transversal cylinder, the cylinder given by flow lines of a Killing vector field. Using this app
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 30/07/2010
-
3. Em DireÃÃo aos N-Grafos Intuicionistas
A apresentaÃÃo dos N-Grafos foi feita por De Oliveira no ano 2001. Este à um sistema de provas que possui regras lÃgicas representadas graficamente por meio de digrafos. Estes grafos de provas se baseiam na deduÃÃo natural e no cÃlculo de sequentes de Gentzen, combinando idÃias de quatro abordagens geomÃtricas consolidadas na literatura de teoria da
Publicado em: 2009
-
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. Nowhere-zero flows and colorings of graphs / Fluxos inteiros e colorações
The theme of this thesis is nowhere-zero flows and colourings of graphs, two subjects that are closely related. We focus mainly on the three Conjectures of Tutte concerning 5-, 4- and 3-nowhere-zero flows. These conjectures were proposed, respectively, in the 50 s, 60 s and 70 s; all of them remain open so far. In this thesis we present three different appro
Publicado em: 2009
-
6. Transformations for proof-graphs with cycle treatment augmented via geometric perspective techniques
O presente trabalho é baseada em dois aspectos fundamentais: (i) o estudo de procedimentos de normalização para sistemas de provas, especialmente para a lógica clássica com dedução natural; e (ii) a investigação de técnicas da perspectiva geométrica aplicadas em propriedades da teoria da prova. Com isso, a motivação específica deste trabalho re
Publicado em: 2009
-
7. 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
-
8. NormalizaÃÃo para os N-Grafos
The main tools of general proof theory are cut-elimination (classical sequent calculus) and normalization (classical natural deduction). In proof theory, both tools are used by several related investigations. But, when we consider a normalization procedure for classical logic with a proof structure which presents more than one conclusion, we find few related
Publicado em: 2005
-
9. 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
-
10. THE CONTACT PROCESS ON GRAPHS
We study the ergodic behavior of the contact process on infinite connected graphs of bounded degree. We show that the fundamental notion of complete convergence is not as well behaved as it was thought to be. In particular there are trees for which complete convergence holds in any number, finite or infinite, of separated intervals of values of the infection
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 2000
-
11. Decomposição otima em orelhas para grafos matching covered
Matching covered graphs are connected graphs in which every edge lies in a perfect matching. The base of this theory was developed by L. Lovász, and as consequence, a characterization to the matching lattice was obtained. Then it was possible to obtain a proof for a relaxation of a conjecture of Tutte, which is related to the four colors problem. There are
Publicado em: 1996
-
12. Interrelations between random walks on diagrams (graphs) with and without cycles.
Three topics are discussed. A discrete-state, continuous-time random walk with one or more absorption states can be studied by a presumably new method: some mean properties, including the mean time to absorption, can be found from a modified diagram (graph) in which each absorption state is replaced by a one-way cycle back to the starting state. The second p