نتایج جستجو برای: characterization methods
تعداد نتایج: 2218188 فیلتر نتایج به سال:
We completely determine the complexity status of the dominating set problem for hereditary graph classes defined by forbidden induced subgraphs with at most five vertices.
A permutation is said to be –avoiding if it does not contain any subsequence having all the same pairwise comparisons as . This paper concerns the characterization and enumeration of permutations which avoid a set of subsequences increasing both in number and in length at the same time. Let be the set of subsequences of the form “ ”, being any permutation on . For ! the only subsequence in #" i...
We completely determine the complexity status of the 3-colorability problem for hereditary graph classes defined by two forbidden induced subgraphs with at most five vertices. © 2015 Elsevier B.V. All rights reserved.
Background: Different methods have been used for characterization of Leishmania promastigotes. Monoclonal antibodies are useful in characterization of Leishmania spp . both amastogotes and promastigotes. Objective: Comparing the characterization of Leishmania spp. promastigotes with immunoperoxidase test (Avidin-Biotin) techniques and an indirect immunofluorescent assay (IFA). Methods: Ap...
since its introduction in 1959, translation quality assessment (tqa) has been among the most addressed research topics in translation studies. during recent years, there has been a crucial increase on the study of tqa. various methods have come on scene. although these methods are based on scientific theories, most of them have remained at the level of theory. juliane house’s model is among tho...
In the study of full bubble model graphs of bounded clique-width and bounded linear clique-width, we determined complete sets of forbidden induced subgraphs, that are minimal in the class of full bubble model graphs. In this note, we show that (almost all of) these graphs are minimal in the class of all graphs. As a corollary, we can give sets of minimal forbidden induced subgraphs for graphs o...
Forbidden minors and subdivisions for toroidal graphs are numerous. In contrast, the toroidal graphs with no K3,3’s have a nice explicit structure and short lists of obstructions. For these graphs, we provide the complete lists of four forbidden minors and eleven forbidden subdivisions.
A graph is 1-extendible if every edge has a 1-factor containing it. A 1-extendible non-bipartite graph G is said to be near bipartite if there exist edges e1 and e2 such that G − {e1, e2} is 1-extendible and bipartite. We characterise the Pfaffian near bipartite graphs in terms of forbidden subgraphs. The theorem extends an earlier characterisation of Pfaffian bipartite graphs.
power transformers are important equipments in power systems. thus there is a large number of researches devoted of power transformers. however, there is still a demand for future investigations, especially in the field of diagnosis of transformer failures. in order to fulfill the demand, the first part reports a study case in which four main types of failures on the active part are investigate...
We analyze the structure of reduced expressions in the Coxeter groups An, Bn and Dn. Several special classes of elements are singled out for their connections with symmetric functions or the theory of P -partitions. Membership in these special classes is characterized in a variety of ways, including forbidden patterns, forbidden subwords, and by the form of canonically chosen reduced words.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید