全文获取类型
收费全文 | 83篇 |
免费 | 1篇 |
国内免费 | 4篇 |
专业分类
综合类 | 3篇 |
数学 | 82篇 |
物理学 | 3篇 |
出版年
2022年 | 1篇 |
2021年 | 1篇 |
2020年 | 1篇 |
2016年 | 1篇 |
2014年 | 1篇 |
2013年 | 3篇 |
2012年 | 3篇 |
2011年 | 3篇 |
2010年 | 5篇 |
2009年 | 6篇 |
2008年 | 7篇 |
2007年 | 6篇 |
2006年 | 10篇 |
2005年 | 5篇 |
2004年 | 4篇 |
2003年 | 6篇 |
2002年 | 1篇 |
2001年 | 2篇 |
2000年 | 1篇 |
1997年 | 2篇 |
1996年 | 2篇 |
1995年 | 4篇 |
1994年 | 3篇 |
1989年 | 1篇 |
1987年 | 1篇 |
1985年 | 3篇 |
1984年 | 1篇 |
1983年 | 1篇 |
1982年 | 3篇 |
排序方式: 共有88条查询结果,搜索用时 250 毫秒
1.
We show that the problem of deciding whether anN-free ordered set has dimension at most 3 is NP-complete.Both authors supported by Office of Naval Research contract N00014-85K-0494. 相似文献
2.
In this paper we show that the recognition problem for C-I graphs of posets is NP-complete. On the other hand, we prove that
induced subgraphs of C-I graphs are exactly complements of comparability graphs, and hence the recognition problem for induced
subgraphs of C-I graphs of posets is polynomial. 相似文献
3.
NP-hardness of the recognition of coordinated graphs 总被引:1,自引:0,他引:1
A graph G is coordinated if the minimum number of colors that can be assigned to the cliques of H in such a way that no two cliques with non-empty intersection receive the same color is equal to the maximum number of cliques
of H with a common vertex, for every induced subgraph H of G. In previous works, polynomial time algorithms were found for recognizing coordinated graphs within some classes of graphs.
In this paper we prove that the recognition problem for coordinated graphs is NP-hard, and it is NP-complete even when restricted
to the class of {gem, C
4, odd hole}-free graphs with maximum degree four, maximum clique size three and at most three cliques sharing a common vertex.
F.J. Soulignac is partially supported by UBACyT Grant X184, Argentina and CNPq under PROSUL project Proc. 490333/2004-4, Brazil. 相似文献
4.
We consider the game of Cops and Robbers played on finite and countably infinite connected graphs. The length of games is considered on cop-win graphs, leading to a new parameter, the capture time of a graph. While the capture time of a cop-win graph on n vertices is bounded above by n−3, half the number of vertices is sufficient for a large class of graphs including chordal graphs. Examples are given of cop-win graphs which have unique corners and have capture time within a small additive constant of the number of vertices. We consider the ratio of the capture time to the number of vertices, and extend this notion of capture time density to infinite graphs. For the infinite random graph, the capture time density can be any real number in [0,1]. We also consider the capture time when more than one cop is required to win. While the capture time can be calculated by a polynomial algorithm if the number k of cops is fixed, it is NP-complete to decide whether k cops can capture the robber in no more than t moves for every fixed t. 相似文献
5.
We show how to use the split decomposition to solve some NP-hard optimization problems on graphs. We give algorithms for clique problem and domination-type problems. Our main result is an algorithm to compute a coloration of a graph using its split decomposition. Finally we show that the clique-width of a graph is bounded if and only if the clique-width of each representative graph in its split decomposition is bounded. 相似文献
6.
提出一种新的关于多维背包(Multi-dimensions Knapsack Problem,MKP)的约束替代问题,MKP是NP-完全问题,称这种约束替代方法为不等式单约束平面生成法.叙述了单约束不等平面生成算法的基本思想,证明了此方法的一些性质及化简问题后所得到的新问题MKPS与原问题MKP的等价性.最后用实例证实了这种化简方法及其有效性。 相似文献
7.
8.
9.
Aniekan Ebiefung 《Mathematical Programming》1995,69(1-3):255-268
We show that the Cottle—Dantzig generalized linear complementarity problem (GLCP) is equivalent to a nonlinear complementarity problem (NLCP), a piecewise linear system of equations (PLS), a multiple objective programming problem (MOP), and a variational inequalities problem (VIP). On the basis of these equivalences, we provide an algorithm for solving problem GLCP.Project partially supported by a grant from Oak Ridge Associated Universities, TN, USA. 相似文献
10.
图的路色数问题的NP-完全性 总被引:3,自引:0,他引:3
一个给定的图是否存在用r种颜色的正常Pk着色?称该问题为图的(k,r)路色数问题.本文研究其算法复杂性,并得到以下结果:对于任意给定的k,2≤k≤∞,图的(k,2)路色数问题及直径为2的图的(k,3)路色数问题都是NP-完全的;对于任意给定的k,2≤k≤∞,平面图的(k,3)路色数问题也是NP-完全的. 相似文献