On Maximum Induced Matching Numbers of Special Grids
نویسندگان
چکیده
منابع مشابه
On the approximability of the maximum induced matching problem
In this paper we consider the approximability of the maximum induced matching problem (MIM). We give an approximation algorithm with asymptotic performance ratio d − 1 for MIM in d-regular graphs, for each d ≥ 3. We also prove that MIM is APXcomplete in d-regular graphs, for each d ≥ 3.
متن کاملthe effect of aqueous extract of garlic on formalin-induced pain in male rats
چکیده اثر عصاره آبی سیر بر درد ناشی از آزمون فرمالین در موش صحرایی نر به کوشش نرگس اسکندری روزبهانی زمینه و هدف: گیاه سیر از خانواده لیلیاسه و گونهallium sativum بومی آسیای میانه بوده و از دوران ،باستان تاکنون به خواص درمانی متفاوت آن مثل: کاهندگی قندخون، کلسترول خون، فشار خون، اثرات مفیدآن بر دستگاه قلبی عروقی و بیماریهای انعقادی خون، اثرات آنتی اکسیداتیو، درمان بیماریهای تنفسی وگوارشی، ا...
15 صفحه اولSplitting Numbers of Grids
For a subset S of a finite ordered set P , let S ↑ = {x ∈ P : x ≥ s for some s ∈ S} and S ↓ = {x ∈ P : x ≤ s for some s ∈ S}. For a maximal antichain A of P , let s(A) = max A=U∪D |U ↑ | + |D↓ | |P | , the maximum taken over all partitions U ∪ D of A, and sk(P ) = min A∈A(P ),|A|=k s(A) where we assume P contains at least one maximal antichain of k elements. Finally, for a class C of finite ord...
متن کاملTwo polynomial algorithms for special maximum matching constructing in trees
For an arbitrary tree we investigate the problems of constructing a maximum matching which minimizes or maximizes the cardinality of a maximum matching of the graph obtained from original one by its removal and present corresponding polynomial algorithms.
متن کاملMaximum induced matching problem on hhd-free graphs
An induced matching in a graph is a set of edges such that no two edges in the set are joined by any third edge of the graph. An induced matching is maximum (MIM) if the number of edges in it is the largest among all possible induced matchings. It is known that finding the size of a MIM in a graph is NP-hard even if the graph is bipartite. It is also known that the size of a MIM in a chordal gr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific Letters of University of Rzeszow Technology - Mechanics
سال: 2018
ISSN: 0209-2689,2300-5211
DOI: 10.7862/rf.2018.1