全文获取类型
收费全文 | 1108篇 |
免费 | 59篇 |
国内免费 | 61篇 |
专业分类
化学 | 206篇 |
晶体学 | 3篇 |
力学 | 57篇 |
综合类 | 31篇 |
数学 | 591篇 |
物理学 | 340篇 |
出版年
2024年 | 3篇 |
2023年 | 17篇 |
2022年 | 22篇 |
2021年 | 22篇 |
2020年 | 41篇 |
2019年 | 40篇 |
2018年 | 31篇 |
2017年 | 26篇 |
2016年 | 32篇 |
2015年 | 31篇 |
2014年 | 54篇 |
2013年 | 96篇 |
2012年 | 46篇 |
2011年 | 63篇 |
2010年 | 64篇 |
2009年 | 94篇 |
2008年 | 98篇 |
2007年 | 75篇 |
2006年 | 56篇 |
2005年 | 55篇 |
2004年 | 40篇 |
2003年 | 40篇 |
2002年 | 24篇 |
2001年 | 17篇 |
2000年 | 21篇 |
1999年 | 21篇 |
1998年 | 25篇 |
1997年 | 10篇 |
1996年 | 9篇 |
1995年 | 7篇 |
1994年 | 3篇 |
1993年 | 3篇 |
1992年 | 10篇 |
1991年 | 3篇 |
1990年 | 2篇 |
1989年 | 5篇 |
1988年 | 4篇 |
1987年 | 3篇 |
1986年 | 3篇 |
1985年 | 1篇 |
1984年 | 2篇 |
1983年 | 2篇 |
1982年 | 3篇 |
1981年 | 1篇 |
1980年 | 2篇 |
1978年 | 1篇 |
排序方式: 共有1228条查询结果,搜索用时 31 毫秒
1.
A (di)graph is supereulerian if it contains a spanning eulerian sub(di)graph. This property is a relaxation of hamiltonicity. Inspired by this analogy with hamiltonian cycles and by similar results in supereulerian graph theory, we analyze a number of sufficient Ore type conditions for a digraph to be supereulerian. Furthermore, we study the following conjecture due to Thomassé and the first author: if the arc‐connectivity of a digraph is not smaller than its independence number, then the digraph is supereulerian. As a support for this conjecture we prove it for digraphs that are semicomplete multipartite or quasitransitive and verify the analogous statement for undirected graphs. 相似文献
2.
O. Fülöp 《Discrete Mathematics》2005,294(3):285-290
We give a short proof for the Mixed Connectivity Certificate Theorem of Even, Itkis and Rajsbaum and provide an upper bound on the edge number of a certificate of local T-mixed connectivity up to k. 相似文献
3.
For an arbitrary bounded closed set E in the complex plane with complement Ω of finite connectivity, we study the degree of convergence of the lemniscates in Ω. 相似文献
4.
Let G=(V,E) be a undirected k-edge connected graph with weights ce on edges and wv on nodes. The minimum 2-edge connected subgraph problem, 2ECSP for short, is to find a 2-edge connected subgraph of G, of minimum total weight. The 2ECSP generalizes the well-known Steiner 2-edge connected subgraph problem. In this paper we study the convex hull of the incidence vectors corresponding to feasible solutions of 2ECSP. First, a natural integer programming formulation is given and it is shown that its linear relaxation is not sufficient to describe the polytope associated with 2ECSP even when G is series-parallel. Then, we introduce two families of new valid inequalities and we give sufficient conditions for them to be facet-defining. Later, we concentrate on the separation problem. We find polynomial time algorithms to solve the separation of important subclasses of the introduced inequalities, concluding that the separation of the new inequalities, when G is series-parallel, is polynomially solvable. 相似文献
5.
Xuechao Li 《Graphs and Combinatorics》2006,22(4):503-513
In this paper, we give new lower bounds for the size of Δ-critical graphs with Δ=8,9 which improve the partial results of
Luo [6] and Y. Zhao [12]. 相似文献
6.
Eckhard Steffen 《Discrete Mathematics》2004,280(1-3):191-214
Cubic bridgeless graphs with chromatic index four are called uncolorable. We introduce parameters measuring the uncolorability of those graphs and relate them to each other. For k=2,3, let ck be the maximum size of a k-colorable subgraph of a cubic graph G=(V,E). We consider r3=|E|−c3 and
. We show that on one side r3 and r2 bound each other, but on the other side that the difference between them can be arbitrarily large. We also compare them to the oddness ω of G, the smallest possible number of odd circuits in a 2-factor of G. We construct cyclically 5-edge connected cubic graphs where r3 and ω are arbitrarily far apart, and show that for each 1c<2 there is a cubic graph such that ωcr3. For k=2,3, let ζk denote the largest fraction of edges that can be k-colored. We give best possible bounds for these parameters, and relate them to each other. 相似文献
7.
The central observation of this paper is that if εn random arcs are added to any n‐node strongly connected digraph with bounded degree then the resulting graph has diameter 𝒪(lnn) with high probability. We apply this to smoothed analysis of algorithms and property testing. Smoothed Analysis: Recognizing strongly connected digraphs is a basic computational task in graph theory. Even for digraphs with bounded degree, it is NL‐complete. By XORing an arbitrary bounded degree digraph with a sparse random digraph R ∼ 𝔻n,ε/n we obtain a “smoothed” instance. We show that, with high probability, a log‐space algorithm will correctly determine if a smoothed instance is strongly connected. We also show that if NL ⫅̸ almost‐L then no heuristic can recognize similarly perturbed instances of (s,t)‐connectivity. Property Testing: A digraph is called k‐linked if, for every choice of 2k distinct vertices s1,…,sk,t1,…,tk, the graph contains k vertex disjoint paths joining sr to tr for r = 1,…,k. Recognizing k‐linked digraphs is NP‐complete for k ≥ 2. We describe a polynomial time algorithm for bounded degree digraphs, which accepts k‐linked graphs with high probability, and rejects all graphs that are at least εn arcs away from being k‐linked. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2007 相似文献
8.
We construct random locally compact real trees called Lévy trees that are the genealogical trees associated with continuous-state
branching processes. More precisely, we define a growing family of discrete Galton–Watson trees with i.i.d. exponential branch
lengths that is consistent under Bernoulli percolation on leaves; we define the Lévy tree as the limit of this growing family
with respect to the Gromov–Hausdorff topology on metric spaces. This elementary approach notably includes supercritical trees
and does not make use of the height process introduced by Le Gall and Le Jan to code the genealogy of (sub)critical continuous-state
branching processes. We construct the mass measure of Lévy trees and we give a decomposition along the ancestral subtree of
a Poisson sampling directed by the mass measure.
T. Duquesne is supported by NSF Grants DMS-0203066 and DMS-0405779. M. Winkel is supported by Aon and the Institute of Actuaries,
EPSRC Grant GR/T26368/01, le département de mathématique de l’Université d’Orsay and NSF Grant DMS-0405779. 相似文献
9.
Summary Thermopiezoelastic materials have recently attracted considerable attention because of their potential use in intelligent
or smart structural systems. The governing equations of a thermopiezoelastic medium are more complex due to the intrinsic
coupling effects that take place among mechanical, electrical and thermal fields. In this analysis, we deal with the problem
of a crack in a semi-infinite, transversely isotropic, thermopiezoelastic material by means of potential functions and Fourier
transforms under steady heat-flux loading conditions. The problem is reduced to a singular integral equation that is solved.
The thermal stress intensity factor for a crack situated in a cadmium selenide material is calculated.
Received 20 March 2001; accepted for publication 18 October 2001 相似文献
10.
Hidefumi Ohsugi 《Journal of Combinatorial Theory, Series A》2006,113(4):718-725
Athanasiadis [Ehrhart polynomials, simplicial polytopes, magic squares and a conjecture of Stanley, J. Reine Angew. Math., to appear.] studies an effective technique to show that Gorenstein sequences coming from compressed polytopes are unimodal. In the present paper we will use such the technique to find a rich class of Gorenstein toric rings with unimodal h-vectors arising from finite graphs. 相似文献