نتایج جستجو برای: convex dominating set

تعداد نتایج: 708049  

Journal: :Discussiones Mathematicae Graph Theory 2018

Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...

Journal: :CoRR 2011
Mingyu Xiao Ton Kloks Sheung-Hung Poon

An edge dominating set of a graph G = (V,E) is a subset M ⊆ E of edges in the graph such that each edge in E −M is incident with at least one edge in M . In an instance of the parameterized edge dominating set problem we are given a graph G = (V,E) and an integer k and we are asked to decide whether G has an edge dominating set of size at most k. In this paper we show that the parameterized edg...

Journal: :INFORMS Journal on Computing 2014
Bernard Gendron Abilio Lucena Alexandre Salles da Cunha Luidi Simonetti

Full terms and conditions of use:

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید