Buscar
Mostrando ítems 21-30 de 104
Valid inequalities and complete characterizations of the 2-domination and P3-hull number polytope
(Universidad Torcuato Di Tella, 2023)
Given a graph G = (V;E), a subset S V is 2-dominating if every vertex in S
has at least two neighbors in S. The minimum cardinality of such a set is called
the 2-domination number of G. Consider a process in discrete ...
Graph inference and graph matching problems : tehory and algorithms
(UR. FI-IIE, 2015)
Almost every field has some problems related with graphs or networks. From natural examples in physics and mathematics, to applications in medicine and signal processing, graphs are either a very powerful tool, or a very ...
Parametrizações de superfícies triangulares
(Universidade Federal do Espírito SantoBRMatemáticaPrograma de Pós-Graduação em MatemáticaUFES, 2012-09-06)
Two types of triangular surface parameterizations are proposed in this work: spherical and planar parameterization. We highlight among the applications of this technique, texture mapping and manipulation/deformation of ...
Two problems about convex polygons in discrete geometry
(Facultad de Ciencias - UASLP, 2022)
Uma abordagem heurística para o problema de otimização de distrito postal
(Universidade Federal do Espírito SantoBRCiência da ComputaçãoPrograma de Pós-Graduação em InformáticaUFES, 2006-06-23)
Neste trabalho é proposta uma estratégia de solução para a construção otimizada de distritos postais. Distrito Postal consiste num conjunto de segmento de eixo de logradouros
conectados. Dada uma localidade formada por ...
Formulations and valid inequalities for the node capacitated graph partitioning problem
(SpringerNew YorkEUA, 1996)
GRASP/VND Optimization Algorithms for Hard Combinatorial Problems
(Udelar.FI, 2019)
Two hard combinatorial problems are addressed in this thesis. The first one is known as the ”Max CutClique”, a combinatorial problem introduced by P. Martins in 2012. Given a simple graph, the goal is to
find a clique C ...
Triangle-free triangulations
(Academic Press Inc Elsevier ScienceSan DiegoEUA, 2010)
The vertex separator problem: a polyhedral investigation
(SpringerNew YorkEUA, 2005)