全文获取类型
收费全文 | 868篇 |
免费 | 103篇 |
国内免费 | 49篇 |
专业分类
化学 | 7篇 |
综合类 | 11篇 |
数学 | 992篇 |
物理学 | 10篇 |
出版年
2024年 | 2篇 |
2023年 | 16篇 |
2022年 | 27篇 |
2021年 | 11篇 |
2020年 | 50篇 |
2019年 | 37篇 |
2018年 | 38篇 |
2017年 | 35篇 |
2016年 | 22篇 |
2015年 | 21篇 |
2014年 | 44篇 |
2013年 | 69篇 |
2012年 | 52篇 |
2011年 | 76篇 |
2010年 | 62篇 |
2009年 | 98篇 |
2008年 | 71篇 |
2007年 | 37篇 |
2006年 | 66篇 |
2005年 | 38篇 |
2004年 | 27篇 |
2003年 | 20篇 |
2002年 | 24篇 |
2001年 | 12篇 |
2000年 | 13篇 |
1999年 | 17篇 |
1998年 | 10篇 |
1997年 | 10篇 |
1995年 | 4篇 |
1994年 | 3篇 |
1993年 | 3篇 |
1990年 | 1篇 |
1988年 | 1篇 |
1987年 | 1篇 |
1985年 | 1篇 |
1984年 | 1篇 |
排序方式: 共有1020条查询结果,搜索用时 15 毫秒
51.
《Journal of computational science》2014,5(1):1-11
Partial differential equations can be discretized using a regular Cartesian grid and a stencil-based method to approximate the partial derivatives. The computational effort for determining the associated Jacobian matrix can be reduced. This reduction can be modeled as a (grid) coloring problem. Currently, this problem is solved by using a heuristic approach for general graphs or by developing a formula for every single stencil. We introduce a sub-exponential algorithm using the Lipton–Tarjan separator in a divide-and-conquer approach to compute an optimal coloring. The practical relevance of the algorithm is evaluated when compared with an exponential algorithm and a greedy heuristic. 相似文献
52.
应用构造染色函数法研究了冠图C_m·C_n、C_m·C_n的邻点可区别V-全染色.通过对P_m·C_n的邻点可区别V-全染色的研究巧妙给出了C_m·C_n邻点可区别V-全染色,并得到了这些图的邻点可区别V-全色数,从而验证了图的邻点可区别V-全染色猜想. 相似文献
53.
54.
V.V. Mkrtchyan 《Discrete Mathematics》2006,306(4):456-459
I prove that in a tree in which the distance between any two endpoints is even, there is a maximum proper partial 0-1 coloring such that the edges colored by 0 form a maximum matching. 相似文献
55.
We give new bounds on the star arboricity and the caterpillar arboricity of planar graphs with given girth. One of them answers an open problem of Gyárfás and West: there exist planar graphs with track number 4. We also provide new NP-complete problems. 相似文献
56.
Graph Coloring with Adaptive Evolutionary Algorithms 总被引:4,自引:0,他引:4
This paper presents the results of an experimental investigation on solving graph coloring problems with Evolutionary Algorithms (EAs). After testing different algorithm variants we conclude that the best option is an asexual EA using order-based representation and an adaptation mechanism that periodically changes the fitness function during the evolution. This adaptive EA is general, using no domain specific knowledge, except, of course, from the decoder (fitness function). We compare this adaptive EA to a powerful traditional graph coloring technique DSatur and the Grouping Genetic Algorithm (GGA) on a wide range of problem instances with different size, topology and edge density. The results show that the adaptive EA is superior to the Grouping (GA) and outperforms DSatur on the hardest problem instances. Furthermore, it scales up better with the problem size than the other two algorithms and indicates a linear computational complexity. 相似文献
57.
58.
关于联图K_(2,n)∨P_m的邻点可区别的全染色 总被引:1,自引:0,他引:1
一个全染色被称为邻点可区别的如果它满足对任意两个相邻点所关联的色集合不同.本文给出了联图K2,n∨Pm的邻点可区别的全色数并且证明了它满足邻点可区别的全染色猜想. 相似文献
59.
Giuseppe Confessore Paolo Dell''Olmo Stefano Giordani 《Discrete Applied Mathematics》2002,120(1-3):73-90
We study the problem of finding an acyclic orientation of an undirected graph, such that each (oriented) path is covered by a limited number k of maximal cliques. This is equivalent to finding a k-approximate solution for the interval coloring problem on a graph. We focus our attention on claw-free chordal graphs, and show how to find an orientation of such a graph in linear time, which guarantees that each path is covered by at most two maximal cliques. This extends previous published results on other graph classes where stronger assumptions were made. 相似文献
60.
D(β)-vertex-distinguishing total coloring of graphs 总被引:1,自引:0,他引:1
Zhang Zhongfu Li Jingwen Chen Xiangen Yao Bing Wang Wenjie Qiu Pengxiang 《中国科学A辑(英文版)》2006,49(10):1430-1440
A new concept of the D(β)-vertex-distinguishing total coloring of graphs, i.e., the proper total coloring such that any two vertices whose distance
is not larger than β have different color sets, where the color set of a vertex is the set composed of all colors of the vertex and the edges
incident to it, is proposed in this paper. The D(2)-vertex-distinguishing total colorings of some special graphs are discussed, meanwhile, a conjecture and an open problem
are presented. 相似文献