The MAXIMUM CUT problem (MAX-CUT) is one of the simplest graph partitioning problems to conceptualize, and yet it is one of the most difficult combinatorial optimization problems to solve. The objective of MAX-CUT is to partition the set of vertices of a graph into two subsets, such that the sum of the weights of the edges having one endpoint in each of the subsets is maximum. This problem is k...

Objetivo: analisar a ocorrência de consultas seguimento das mulheres usuárias DIU cobre (TCu 380A), inserido durante período pós-placentário (pós-parto e trans-cesárea), em um hospital público, da região Sul do Brasil. Método: coorte prospectiva com que inseriram o no responderam ao questionário referente à consulta seguimento. A coleta ocorreu entre setembro/2020 fevereiro/2021. Utilizou-se te...

Let G be a minimal imperfect P 5-free graph (i.e. a minimal imperfect graph not containing a path on 5 vertices as induced subgraph) and let S be a minimal cutset of G. In this paper we study several properties of such cutsets, in particular we prove that the subgraph induced by S is connected, contains a P 4 , cannot induce a bipartite subgraph of G .... As a by-product we also give a structur...