全文获取类型
收费全文 | 2768篇 |
免费 | 154篇 |
国内免费 | 79篇 |
专业分类
化学 | 81篇 |
晶体学 | 1篇 |
力学 | 5篇 |
综合类 | 29篇 |
数学 | 2754篇 |
物理学 | 131篇 |
出版年
2024年 | 12篇 |
2023年 | 68篇 |
2022年 | 91篇 |
2021年 | 60篇 |
2020年 | 118篇 |
2019年 | 105篇 |
2018年 | 99篇 |
2017年 | 102篇 |
2016年 | 67篇 |
2015年 | 55篇 |
2014年 | 100篇 |
2013年 | 249篇 |
2012年 | 76篇 |
2011年 | 146篇 |
2010年 | 139篇 |
2009年 | 252篇 |
2008年 | 201篇 |
2007年 | 158篇 |
2006年 | 158篇 |
2005年 | 92篇 |
2004年 | 88篇 |
2003年 | 85篇 |
2002年 | 74篇 |
2001年 | 60篇 |
2000年 | 58篇 |
1999年 | 52篇 |
1998年 | 45篇 |
1997年 | 39篇 |
1996年 | 24篇 |
1995年 | 9篇 |
1994年 | 14篇 |
1993年 | 13篇 |
1992年 | 9篇 |
1991年 | 8篇 |
1990年 | 11篇 |
1989年 | 12篇 |
1988年 | 9篇 |
1987年 | 2篇 |
1986年 | 3篇 |
1985年 | 12篇 |
1984年 | 11篇 |
1983年 | 3篇 |
1982年 | 4篇 |
1981年 | 2篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1978年 | 2篇 |
1977年 | 1篇 |
1970年 | 1篇 |
排序方式: 共有3001条查询结果,搜索用时 0 毫秒
71.
Clique-Helly and hereditary clique-Helly graphs are polynomial-time recognizable. Recently, we presented a proof that the clique graph recognition problem is NP-complete [L. Alcón, L. Faria, C.M.H. de Figueiredo, M. Gutierrez, Clique graph recognition is NP-complete, in: Proc. WG 2006, in: Lecture Notes in Comput. Sci., vol. 4271, Springer, 2006, pp. 269-277]. In this work, we consider the decision problems: given a graph G=(V,E) and an integer k≥0, we ask whether there exists a subset V′⊆V with |V′|≥k such that the induced subgraph G[V′] of G is, variously, a clique, clique-Helly or hereditary clique-Helly graph. The first problem is clearly NP-complete, from the above reference; we prove that the other two decision problems mentioned are NP-complete, even for maximum degree 6 planar graphs. We consider the corresponding maximization problems of finding a maximum induced subgraph that is, respectively, clique, clique-Helly or hereditary clique-Helly. We show that these problems are Max SNP-hard, even for maximum degree 6 graphs. We show a general polynomial-time -approximation algorithm for these problems when restricted to graphs with fixed maximum degree Δ. We generalize these results to other graph classes. We exhibit a polynomial 6-approximation algorithm to minimize the number of vertices to be removed in order to obtain a hereditary clique-Helly subgraph. 相似文献
72.
This paper considers a new class of network flows, called dynamic generative network flows in which, the flow commodity is dynamically generated at a source node and dynamically consumed at a sink node and the arc-flow bounds are time dependent. Then the maximum dynamic flow problem in such networks for a pre-specified time horizon T is defined and mathematically formulated in both arc flow and path flow presentations. By exploiting the special structure of the problem, an efficient algorithm is developed to solve the general form of the dynamic problem as a minimum cost static flow problem. 相似文献
73.
Martín D. Safe 《Journal of Graph Theory》2020,93(2):268-298
A graph is concave-round if its vertices can be circularly enumerated so that the closed neighborhood of each vertex is an interval in the enumeration. In this study, we give a minimal forbidden induced subgraph characterization for the class of concave-round graphs, solving a problem posed by Bang-Jensen, Huang, and Yeo [SIAM J. Discrete Math., 13 (2000), pp. 179–193]. In addition, we show that it is possible to find one such forbidden induced subgraph in linear time in any given graph that is not concave-round. As part of the analysis, we obtain characterizations by minimal forbidden submatrices for the circular-ones property for rows and for the circular-ones property for rows and columns and show that, also for both variants of the property, one of the corresponding forbidden submatrices can be found (if present) in any given matrix in linear time. We make some final remarks regarding connections to some classes of circular-arc graphs. 相似文献
74.
75.
We show that there is no (95, 40, 12, 20) strongly regular graph and, consequently, there is no (96, 45, 24, 18) strongly regular graph, no nontrivial regular two‐graph on 96 vertices, and no partial geometry pg(4, 9, 2). The main idea of the result is based on the star complement technique and requires a moderate amount of computation. 相似文献
76.
In this paper, we prove that a Cayley digraph Γ = Cay(G, S) is a nontrivial lexicographical product if and only if there is a nontrivial subgroup H of G such that S∖H is a union of some double cosets of H in G.
相似文献
77.
Let be a nonstandard model of Peano Arithmetic with domain M and let be nonstandard. We study the symmetric and alternating groups S
n
and A
n
of permutations of the set internal to , and classify all their normal subgroups, identifying many externally defined such normal subgroups in the process. We provide
evidence that A
n
and S
n
are not split extensions by these normal subgroups, by showing that any such complement if it exists, cannot be a limit of
definable sets. We conclude by identifying an -valued metric on and (where B
S
, B
A
are the maximal normal subgroups of S
n
and A
n
identified earlier) making these groups into topological groups, and by showing that if is -saturated then and are complete with respect to this metric.
相似文献
78.
Ronald I. Becker Isabella Lari Andrea Scozzari Giovanni Storchi 《Annals of Operations Research》2007,150(1):65-78
In this paper we consider the location of a path shaped facility on a grid graph. In the literature this problem was extensively
studied on particular classes of graphs as trees or series-parallel graphs. We consider here the problem of finding a path
which minimizes the sum of the (shortest) distances from it to the other vertices of the grid, where the path is also subject
to an additional constraint that takes the form either of the length of the path or of the cardinality. We study the complexity
of these problems and we find two polynomial time algorithms for two special cases, with time complexity of O(n) and O(nℓ) respectively, where n is the number of vertices of the grid and ℓ is the cardinality of the path to be located.
The literature about locating dimensional facilities distinguishes between the location of extensive facilities in continuous
spaces and network facility location. We will show that the problems presented here have a close connection with continuous
dimensional facility problems, so that the procedures provided can also be useful for solving some open problems of dimensional
facilities location in the continuous case. 相似文献
79.
HE Yue School of Mathematics Computing Science Zhongshan University Guangzhou China School of Mathematics Computing Science Nanjing Normal University Nanjing China. 《数学年刊A辑(中文版)》2007,(5)
研究一类特殊退化椭圆型方程边值问题的适定性,该类问题与双曲空间中的极小图的Dirichlet问题,曲面的无穷小等距形变刚性问题等等的研究密切相关,而这类方程的特征形式在区域上是变号的,其适定性是值得深入讨论的.最后,得到这类边值问题的H~1弱解的存在性和唯一性. 相似文献
80.
Marston Conder Aleksander Malnič Dragan Marušič Primž Potočnik 《Journal of Algebraic Combinatorics》2006,23(3):255-294
A list is given of all semisymmetric (edge- but not vertex-transitive) connected finite cubic graphs of order up to 768. This
list was determined by the authors using Goldschmidt's classification of finite primitive amalgams of index (3,3), and a computer
algorithm for finding all normal subgroups of up to a given index in a finitely-presented group. The list includes several
previously undiscovered graphs. For each graph in the list, a significant amount of information is provided, including its
girth and diameter, the order of its automorphism group, the order and structure of a minimal edge-transitive group of automorphisms,
its Goldschmidt type, stabiliser partitions, and other details about its quotients and covers. A summary of all known infinite
families of semisymmetric cubic graphs is also given, together with explicit rules for their construction, and members of
the list are identified with these. The special case of those graphs having K1,3 as a normal quotient is investigated in detail.
Supported in part by N.Z. Marsden Fund (grant no. UOA 124) and N.Z. Centres of Research Excellence Fund (grant no. UOA 201)
Supported in part by “Ministrstvo za šolstvo, znanost in šport Slovenije”, research program no. 101-506.
Supported in part by research projects no. Z1-4186-0101 and no. Z1-3124-0101. The fourth author would like to thank the University
of Auckland for hospitality during his visit there in 2003. 相似文献