Buscar
Mostrando ítems 1-10 de 158
Planaridade em grafos: o teorema de KuratowskiPlanarity in graphs : Kuratowski’s theorem
(Mestrado Profissional em MatemáticaUniversidade Federal de Sergipe, 2017)
On the k-restricted structure ratio in planar and outerplanar graphs
(DISCRETE MATHEMATICS THEORETICAL COMPUTER SCIENCE, 2008)
A planar k-restricted structure is a simple graph whose blocks are planar and each has at most k vertices. Planar k-restricted structures are used by approximation algorithms for Maximum Weight Planar Subgraph, which ...
The non planar vertex deletion of C-n x C-m
(Charles Babbage Res CtrWinnipegCanadá, 2005)
Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs
(Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2018)
We consider two optimization problems in planar graphs. In Maximum Weight Independent Set of Objects we are given a graph G and a family D of objects, each being a
connected subgraph of G with a prescribed weight, and the ...
On the complexity of { k } -domination and k-tuple domination in graphs
(Elsevier Science, 2015-06)
We consider two types of graph domination - {k}-domination and k-tuple domination, for a fixed positive integer k - and provide new NP-complete as well as polynomial time solvable instances for their related decision ...
Planarização de grafos por remoção de vértices.Graph planarization by vertex deletion.
(Universidade Estadual de MaringáBrasilPrograma de Pós-Graduação em Ciência da ComputaçãoUEMMaringáDepartamento de Informática, 2018)