全文获取类型
收费全文 | 2101篇 |
免费 | 363篇 |
国内免费 | 116篇 |
专业分类
化学 | 129篇 |
晶体学 | 19篇 |
力学 | 174篇 |
综合类 | 52篇 |
数学 | 1402篇 |
物理学 | 804篇 |
出版年
2023年 | 33篇 |
2022年 | 84篇 |
2021年 | 52篇 |
2020年 | 90篇 |
2019年 | 76篇 |
2018年 | 87篇 |
2017年 | 98篇 |
2016年 | 76篇 |
2015年 | 52篇 |
2014年 | 111篇 |
2013年 | 168篇 |
2012年 | 113篇 |
2011年 | 159篇 |
2010年 | 129篇 |
2009年 | 184篇 |
2008年 | 165篇 |
2007年 | 119篇 |
2006年 | 136篇 |
2005年 | 104篇 |
2004年 | 94篇 |
2003年 | 72篇 |
2002年 | 76篇 |
2001年 | 54篇 |
2000年 | 39篇 |
1999年 | 46篇 |
1998年 | 32篇 |
1997年 | 28篇 |
1996年 | 14篇 |
1995年 | 20篇 |
1994年 | 10篇 |
1993年 | 12篇 |
1992年 | 7篇 |
1991年 | 10篇 |
1990年 | 6篇 |
1989年 | 4篇 |
1988年 | 3篇 |
1987年 | 5篇 |
1986年 | 2篇 |
1985年 | 2篇 |
1984年 | 3篇 |
1982年 | 1篇 |
1979年 | 2篇 |
1978年 | 1篇 |
1976年 | 1篇 |
排序方式: 共有2580条查询结果,搜索用时 31 毫秒
101.
Philippe Galinier 《Discrete Applied Mathematics》2008,156(2):267-279
Let G=(V,E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1,…,k}) to each vertex of G so that no edge has both endpoints with the same color. The adaptive memory algorithm is a hybrid evolutionary heuristic that uses a central memory. At each iteration, the information contained in the central memory is used for producing an offspring solution which is then possibly improved using a local search algorithm. The so obtained solution is finally used to update the central memory. We describe in this paper an adaptive memory algorithm for the k-coloring problem. Computational experiments give evidence that this new algorithm is competitive with, and simpler and more flexible than, the best known graph coloring algorithms. 相似文献
102.
Dieter Rautenbach 《Journal of Graph Theory》2008,58(2):139-147
In 1976, Borodin conjectured that every planar graph has a 5‐coloring such that the union of every k color classes with 1 ≤ k ≤ 4 induces a (k—1)‐degenerate graph. We prove the existence of such a coloring using 18 colors. © 2008 Wiley Periodicals, Inc. J Graph Theory 58:139–147, 2008 相似文献
103.
104.
We consider the vertex coloring problem, which can be stated as the problem of minimizing the number of labels that can be assigned to the vertices of a graph G such that each vertex receives at least one label and the endpoints of every edge are assigned different labels. In this work, the 0-1 integer programming formulation based on representative vertices is revisited to remove symmetry. The previous polyhedral study related to the original formulation is adapted and generalized. New versions of facets derived from substructures of G are presented, including cliques, odd holes and anti-holes and wheels. In addition, a new class of facets is derived from independent sets of G. Finally, a comparison with the independent sets formulation is provided. 相似文献
105.
刀口定量检验技术的研究 总被引:5,自引:0,他引:5
主要介绍了天文镜面加工的中的刀口定量检验技术,包括阴影图像CCD实时采集,图像处理,定量计算。 相似文献
106.
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. 相似文献
107.
Kiyoshi Ando 《Journal of Graph Theory》2009,60(2):99-129
An edge of a 5‐connected graph is said to be contractible if the contraction of the edge results in a 5‐connected graph. Let x be a vertex of a 5‐connected graph. We prove that if there are no contractible edges whose distance from x is two or less, then either there are two triangles with x in common each of which has a distinct degree five vertex other than x, or there is a specified structure called a K4?‐configuration with center x. As a corollary, we show that if a 5‐connected graph on n vertices has no contractible edges, then it has 2n/5 vertices of degree 5. © 2008 Wiley Periodicals, Inc. J Graph Theory 60: 99–129, 2009 相似文献
108.
We analyze batch-scheduling problems that arise in connection with certain industrial applications. The models concern processing on a single max-batch machine with the additional feature that the tasks of the same batch have to be compatible. Compatibility is a symmetric binary relation—the compatible pairs are described with an undirected “compatibility graph”, which is often an interval graph according to some natural practical conditions that we present. We consider several models with varying batch capacities, processing times or compatibility graphs. We summarize known results, and present a min-max formula and polynomial time algorithms. 相似文献
109.
Michael J. Fisher 《Discrete Mathematics》2008,308(11):2240-2246
We determine the values of s and t for which there is a coloring of the edges of the complete bipartite graph Ks,t which admits only the identity automorphism. In particular, this allows us to determine the distinguishing number of the Cartesian product of complete graphs. 相似文献
110.
Xuding Zhu 《Journal of Graph Theory》2008,59(4):261-278
This article proves the following result: Let G and G′ be graphs of orders n and n′, respectively. Let G* be obtained from G by adding to each vertex a set of n′ degree 1 neighbors. If G* has game coloring number m and G′ has acyclic chromatic number k, then the Cartesian product G□G′ has game chromatic number at most k(k + m ? 1). As a consequence, the Cartesian product of two forests has game chromatic number at most 10, and the Cartesian product of two planar graphs has game chromatic number at most 105. © 2008 Wiley Periodicals, Inc. J Graph Theory 59: 261–278, 2008 相似文献