共查询到20条相似文献,搜索用时 15 毫秒
1.
A parity walk in an edge-coloring of a graph is a walk along which each color is used an even number of times. A parity edge-coloring (respectively, strong parity edge-coloring) is an edge-coloring in which there is no nontrivial parity path (respectively, open parity walk). The parity edge-chromatic number p(G) (respectively, strong parity edge-chromatic number $\widehat{p}(G)$ ) is the least number of colors in a parity edge-coloring (respectively, strong parity edge-coloring) of G. Notice that $\widehat{p}(G) \ge p(G) \ge \chi'(G) \ge \Delta(G)$ for any graph G. In this paper, we determine $\widehat{p}(G)$ and p(G) for some complete bipartite graphs and some products of graphs. For instance, we determine $\widehat{p}(K_{m,n})$ and p(K m,n ) for m≤n with n≡0,?1,?2 (mod 2?lg?m?). 相似文献
2.
An adjacent vertex distinguishing edge-coloring of a graph G is a proper edge coloring of G such that any pair of adjacent vertices are incident to distinct sets of colors. The minimum number of colors required for
an adjacent vertex distinguishing edge-coloring of G is denoted by χ′
a
(G). Let
mad(G)\mathop{\mathrm{mad}}(G)
and Δ denote the maximum average degree and the maximum degree of a graph G, respectively. 相似文献
3.
4.
6.
7.
《Journal of Organizational Behavior Management》2013,33(1-2):27-53
Abstract This article comments on an argument in favor of a change in OBM's content and focus to include certain empirical findings and theoretical constructs derived from fields like Cognitive and Social Psychology. Specifically, the argument suggests that personal beliefs such as optimism, self-efficacy, and response-efficacy are influential determinants of behavior that give rise to achievement motivation and a success-seeking typology. By incorporating such constructs into OBM, it is suggested that the field will better align itself with related disciplines sharing the goal of promoting personal success, thereby enhancing its performance-improvement toolkit and fostering greater recognition and acceptance for itself within mainstream Psychology. After summarizing key aspects of this argument, this paper identifies certain of its associated challenges and then presents some specific strategies by which the OBM community can chart a future course for the field. 相似文献
8.
9.
10.
11.
12.
13.
A player's pure strategy is called relevant for an outcome of a game in extensive form with perfect recall if there exists a weakly sequential equilibrium with that outcome for which the strategy is an optimal reply at every information set it does not exclude. The outcome satisfies forward induction if it results from a weakly sequential equilibrium in which players' beliefs assign positive probability only to relevant strategies at each information set reached by a profile of relevant strategies. We prove that if there are two players and payoffs are generic, then an outcome satisfies forward induction if every game with the same reduced normal form after eliminating redundant pure strategies has a sequential equilibrium with an equivalent outcome. Thus in this case forward induction is implied by decision‐theoretic criteria. 相似文献
14.
15.
16.
We study a new coloring concept which generalizes the classical vertex coloring problem in a graph by extending the notion
of stable sets to split graphs. First of all, we propose the packing problem of finding the split graph of maximum size where
a split graph is a graph G = (V,E) in which the vertex set V can be partitioned into a clique K and a stable set S. No condition is imposed on the edges linking vertices in S to the vertices in K. This maximum split graph problem gives rise to an associated partitioning problem that we call the split-coloring problem.
Given a graph, the objective is to cover all his vertices by a least number of split graphs. Definitions related to this new
problem are introduced. We mention some polynomially solvable cases and describe open questions on this area.
An erratum to this article is available at . 相似文献
17.
基于SVM的建设项目风险识别方法研究 总被引:3,自引:0,他引:3
支持向量机(SVM)是在统计学习理论的基础上发展起来的一种新的机器学习方法。它基于结构风险最小化原则,能有效地解决过学习问题,具有良好的推广性和分类精确性。在项目风险管理中,风险识别是很重要的一个步骤,如果风险不能被识别,那么我们就不能对风险进行转移、控制或管理。针对该问题,本文提出了一种新的风险识别方法-支持向量机,利用该方法对项目风险识别进行了研究,并取得了很好的识别效果。 相似文献
18.
19.
20.
Reuven Cohen Mira Gonen Asaf Levin Shmuel Onn 《Journal of Combinatorial Optimization》2017,33(2):645-659
In this paper we define the exact k-coverage problem, and study it for the special cases of intervals and circular-arcs. Given a set system consisting of a ground set of n points with integer demands \(\{d_0,\dots ,d_{n-1}\}\) and integer rewards, subsets of points, and an integer k, select up to k subsets such that the sum of rewards of the covered points is maximized, where point i is covered if exactly \(d_i\) subsets containing it are selected. Here we study this problem and some related optimization problems. We prove that the exact k-coverage problem with unbounded demands is NP-hard even for intervals on the real line and unit rewards. Our NP-hardness proof uses instances where some of the natural parameters of the problem are unbounded (each of these parameters is linear in the number of points). We show that this property is essential, as if we restrict (at least) one of these parameters to be a constant, then the problem is polynomial time solvable. Our polynomial time algorithms are given for various generalizations of the problem (in the setting where one of the parameters is a constant). 相似文献