全文获取类型
收费全文 | 2085篇 |
免费 | 132篇 |
国内免费 | 107篇 |
专业分类
化学 | 207篇 |
力学 | 56篇 |
综合类 | 51篇 |
数学 | 1701篇 |
物理学 | 309篇 |
出版年
2024年 | 3篇 |
2023年 | 37篇 |
2022年 | 65篇 |
2021年 | 47篇 |
2020年 | 62篇 |
2019年 | 75篇 |
2018年 | 58篇 |
2017年 | 65篇 |
2016年 | 63篇 |
2015年 | 55篇 |
2014年 | 100篇 |
2013年 | 162篇 |
2012年 | 84篇 |
2011年 | 104篇 |
2010年 | 119篇 |
2009年 | 137篇 |
2008年 | 159篇 |
2007年 | 142篇 |
2006年 | 121篇 |
2005年 | 65篇 |
2004年 | 72篇 |
2003年 | 62篇 |
2002年 | 55篇 |
2001年 | 60篇 |
2000年 | 43篇 |
1999年 | 47篇 |
1998年 | 49篇 |
1997年 | 26篇 |
1996年 | 28篇 |
1995年 | 24篇 |
1994年 | 28篇 |
1993年 | 16篇 |
1992年 | 13篇 |
1991年 | 11篇 |
1990年 | 7篇 |
1989年 | 5篇 |
1987年 | 4篇 |
1986年 | 9篇 |
1985年 | 5篇 |
1984年 | 5篇 |
1983年 | 2篇 |
1982年 | 10篇 |
1981年 | 7篇 |
1980年 | 5篇 |
1979年 | 2篇 |
1978年 | 1篇 |
1977年 | 1篇 |
1976年 | 1篇 |
1971年 | 1篇 |
1957年 | 1篇 |
排序方式: 共有2324条查询结果,搜索用时 968 毫秒
1.
《Operations Research Letters》2022,50(3):274-280
The minimum k-enclosing ball problem seeks the ball with smallest radius that contains at least k of m given points. This problem is NP-hard. We present a branch-and-bound algorithm on the tree of the subsets of k points to solve this problem. Our method is able to solve the problem exactly in a short amount of time for small and medium sized datasets. 相似文献
2.
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. 相似文献
3.
A Necessary and Sufficient Condition for the Existence of a Heterochromatic Spanning Tree in a Graph
Kazuhiro Suzuki 《Graphs and Combinatorics》2006,22(2):261-269
We prove the following theorem. An edge-colored (not necessary to be proper) connected graph G of order n has a heterochromatic spanning tree if and only if for any r colors (1≤r≤n−2), the removal of all the edges colored with these r colors from G results in a graph having at most r+1 components, where a heterochromatic spanning tree is a spanning tree whose edges have distinct colors. 相似文献
4.
Given a tree
with leaf set X, there are certain ways of arranging the elements of X in a circular order so that
can be embedded in the plane and ‘preserve’ this ordering. We investigate some new combinatorial properties of these ‘circular orderings.’ We then use these properties to establish two results concerning dissimilarity maps on X that are induced by edge-weighted trees with leaf set X. 相似文献
5.
6.
7.
Searching in trees 总被引:1,自引:0,他引:1
Frank Recker 《Discrete Applied Mathematics》2004,140(1-3):169-183
In (Discrete Math. 17 (1977)181) Rivest introduced the search complexity of binary trees and proved that among all binary trees with a fixed search complexity the smallest ones are the so-called Fibonacci trees. This result is extended for q-trees. The structure of the smallest q-trees is again Fibonacci-like but more complicated than in the binary case. In addition an upper bound for the asymptotic growth of these trees is given. 相似文献
8.
We deal with MAXH0-FREE PARTIAL SUBGRAPH. We mainly prove that 3-locally optimum solutions achieve approximation ratio (δ0+1)/(B+2+ν0), where B=maxv∈VdG(v), δ0=minv∈V(H0)dH0(v) and ν0=(|V(H0)|+1)/δ0. Next, we show that this ratio rises up to 3/(B+1) when H0=K3. Finally, we provide hardness results for MAXK3-FREE PARTIAL SUBGRAPH. 相似文献
9.
We present an O(min(Kn,n2)) algorithm to solve the maximum integral multiflow and minimum multicut problems in rooted trees, where K is the number of commodities and n is the number of vertices. These problems are NP-hard in undirected trees but polynomial in directed trees. In the algorithm we propose, we first use a greedy procedure to build the multiflow then we use duality properties to obtain the multicut and prove the optimality. 相似文献
10.
In this paper, we study the stability conditions of the MMAP[K]/G[K]/1/LCFS preemptive repeat queue. We introduce an embedded Markov chain of matrix M/G/1 type with a tree structure and identify conditions for the Markov chain to be ergodic. First, we present three conventional methods for the stability problem of the queueing system of interest. These methods are either computationally demanding or do not provide accurate information for system stability. Then we introduce a novel approach that develops two linear programs whose solutions provide sufficient conditions for stability or instability of the queueing system. The new approach is numerically efficient. The advantages and disadvantages of the methods introduced in this paper are analyzed both theoretically and numerically. 相似文献