نتایج جستجو برای: روش fpt
تعداد نتایج: 370560 فیلتر نتایج به سال:
For a positive integer d, the d-CUT is problem of deciding if an undirected graph $$G=(V,E)$$ has nontrivial bipartition (A, B) V such that every vertex in A (resp. at most d neighbors B A). When $$d=1$$ , this MATCHING CUT problem. Gomes and Sau [9] gave first fixed-parameter tractable algorithm for parameterized by maximum number crossing edges cut (i.e., size edge cut). However, their paper ...
In this paper, we have extended and deepened the study on fractional order phase transition (FPT) of a charged AdS black hole. We carried out detailed analysis FPT for several hole prototypes: surrounded by quintessence background, 5D Gauss-Bonnet, D dimensional RN-AdS BH, lastly Kerr holes. shown that 4/3 at critical points holds first three holes systems, while holes, is rather 1/3. These res...
This dissertation offers contributions to the area of parameterized complexity theory, which studies the complexity of computational problems in a multivariate framework. We demonstrate that for graph problems, many popular parameters can be understood as distances that measure how far a graph is from belonging to a class of sparse graphs. We introduce the term distance parameter for such param...
Consider a graph G = (V, E) and a coloring c of vertices with colors from [l]. A vertex v is said to be happy with respect to c if c(v) = c(u) for all neighbors u of v. Further, an edge (u, v) is happy if c(u) = c(v). Given a partial coloring c of V, the Maximum Happy Vertex (Edge) problem asks for a total coloring of V extending c to all vertices of V that maximises the number of happy vertice...
A challenging task in computational biology is the reconstruction of genomic sequences of extinct ancestors, given the phylogenetic tree and the sequences at the leafs. This task is best solved by calculating the most likely estimate of the ancestral sequences, along with the most likely edge lengths. We deal with this problem and also the variant in which the phylogenetic tree in addition to t...
مقدمه و هدف: سالهاست که داروهای آنتیبیوتیکی جایگاه ویژهای در درمان و کنترل بیماریها و عوامل میکروبی دارند. اما بایستی به این نکته توجه نمود که عدم مصرف صحیح این داروها میتواند مشکلات متعددی نظیر مسمومیتها، واکنشهای آلرژیک و اختلال در میکروفلور طبیعی بدن را سبب گردد، و از همه مهمتر مقاومتهای دارویی است که یکی از عوامل عمده در ایجاد آن، باقیماندههای آنتیبیوتیکی ...
This survey reviews the basic notions of parameterized complexity, and describes some new approaches to designing FPT algorithms and problem reductions for graph problems.
One of the biggest experimental programs helping to improve nuclear installation safety is PHEBUS, an international cooperative research program that provides data for validating computer codes dedicated analysis severe accidents and their calculation results. In European Union, HORIZON 2020 EURATOM project MUSA (Management Uncertainties Severe Accidents) in progress. Modelling PHEBUS FPT-1 tes...
Fixed-parameter tractability (FPT) techniques have recently been successful in solving NP-complete problem instances of practical importance which were too large to be solved with previous methods. In this paper, we show how to enhance this approach through the addition of parallelism, thereby allowing even larger problem instances to be solved in practice. More precisely, we demonstrate the po...
BACKGROUND Anorexia nervosa (AN) is a serious illness leading to substantial morbidity and mortality. The treatment of AN very often is protracted; repeated hospitalizations and lost productivity generate substantial economic costs in the health care system. Therefore, this study aimed to determine the differential cost-effectiveness of out-patient focal psychodynamic psychotherapy (FPT), enhan...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید