Buscar
Mostrando ítems 11-20 de 335
Ponencia
Computing the stretch of an embedded graph
(2013)
Let G be a graph embedded in an orientable surface Σ, possibly with edge weights, and denote by len(γ) the length (the number of edges or the sum of the edge weights) of a cycle γ in G. The stretch of a graph embedded on ...
Ponencia
Propiedades de las matrices totalmente no positivas
(2007-09)
Una matriz real A se dice que es totalmente (negativa) no positiva si todos sus menores son (negativos) no positivos. En este trabajo veremos la factorización LDU de una matriz totalmente no positiva e invertible a partir ...
Ponencia
On geodesic and monophonic convexity
(2004)
In this paper we deal with two types of graph convexities, which are the most natural path convexities in a graph and which are defined by a system P of paths in a connected graph G: the geodesic convexity (also called ...
Ponencia
On relative isodiametric inequalities
(2004)
We consider subdivisions of convex bodies G in two subsets E and G\E. We obtain several inequalities comparing the relative volume 1) with the minimum relative diameter and 2) with the maximum relative diameter. In the ...
Ponencia
Subsistemas singulares de un sistema lineal. Una aproximación a los subespacios cuasiinvariantes
(2007-09)
Dado un sistema lineal ˙x = Ax + By, se definen los subespacios cuasi-(A, B)- invariantes como aquellos tales que para cada condición inicial en el subespacio, existe un control u(t) que hace que la correspondiente ...
Ponencia
A branch-and-bound algorithm for quadratic 0-1 optimization
(Alberto Márquez, 2002)
Ponencia
Algunas notas sobre mosaicos de Penrose
(Alberto Márquez, 2002)
Ponencia
Dynamics for a non-linear and non-autonomous compartmental system
(2007-09)
We study the long-time behavior of the amount of material within the compartments of a compartmental system for which the flow of material does not have to be instantaneous and may even take an infinite time to occur. ...
Ponencia
Metaheuristic approaches for the minimum dilation triangulation problem
(2013)
We focus on the development of approximated algorithms to find high quality triangulations of minimum dilation because the complexity status of the Minimum Dilation Triangulation problem for a general point set is unknown. ...
Ponencia
A domain decomposition method derived from the Primal Hybrid Formulations for 2nd order elliptic problems
(2007-09)
We consider the primal hybrid formulation for second order elliptic problems introduced by Raviart-Thomas and apply the classical iterative method of Uzawa to obtain a non overlapping domain decomposition method that ...