Buscar
Mostrando ítems 11-18 de 18
Coordinated graphs and clique graphs of clique-Helly perfect graphs
(2007)
A new class of graphs related to perfect graphs is defined in this work: coordinated graphs. A graph G is coordinated if the cardinality of a maximum set of cliques of H with a common vertex is equal to the cardinality of ...
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 ...
Domination Invariant of a Diameter Constrained Network Reliability Model
(UR. FI – INCO., 2004)
Let G=(V,E) be a digraph with a distinguished set of terminal vertices K in V and a vertex s in K. We define the s,K-diameter of G as the maximum distance between s and any of vertices of K. If the arcs fail randomly and ...