全文获取类型
收费全文 | 168篇 |
免费 | 25篇 |
国内免费 | 3篇 |
专业分类
化学 | 8篇 |
晶体学 | 2篇 |
力学 | 2篇 |
综合类 | 1篇 |
数学 | 144篇 |
物理学 | 39篇 |
出版年
2023年 | 3篇 |
2022年 | 8篇 |
2021年 | 4篇 |
2020年 | 6篇 |
2019年 | 13篇 |
2018年 | 8篇 |
2017年 | 6篇 |
2016年 | 5篇 |
2015年 | 5篇 |
2014年 | 7篇 |
2013年 | 10篇 |
2012年 | 10篇 |
2011年 | 12篇 |
2010年 | 5篇 |
2009年 | 11篇 |
2008年 | 18篇 |
2007年 | 5篇 |
2006年 | 5篇 |
2005年 | 8篇 |
2004年 | 8篇 |
2003年 | 9篇 |
2002年 | 7篇 |
2001年 | 2篇 |
2000年 | 4篇 |
1999年 | 1篇 |
1998年 | 4篇 |
1997年 | 4篇 |
1996年 | 1篇 |
1994年 | 1篇 |
1992年 | 1篇 |
1990年 | 1篇 |
1989年 | 2篇 |
1988年 | 1篇 |
1985年 | 1篇 |
排序方式: 共有196条查询结果,搜索用时 15 毫秒
1.
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. 相似文献
2.
Yong Nam Choi Shin Ae Kim Sung Kyu Kim Sung Baek Kim Chang-Hee Lee Pavel Mikula 《Pramana》2004,63(1):175-181
In a conventional diffractometer having single monochromator, only one position, parallel position, is used for the diffraction
experiment (i.e. detection) because the resolution property of the other one, anti-parallel position, is very poor. However,
a bent perfect crystal (BPC) monochromator at monochromatic focusing condition can provide a quite flat and equal resolution
property at both parallel and anti-parallel positions and thus one can have a chance to use both sides for the diffraction
experiment. From the data of the FWHM and the Δd/d measured on three diffraction geometries (symmetric, asymmetric compression and asymmetric expansion), we can conclude that
the simultaneous diffraction measurement in both parallel and anti-parallel positions can be achieved. 相似文献
3.
We prove that for every fixed k and ? ≥ 5 and for sufficiently large n, every edge coloring of the hypercube Qn with k colors contains a monochromatic cycle of length 2 ?. This answers an open question of Chung. Our techniques provide also a characterization of all subgraphs H of the hypercube which are Ramsey, that is, have the property that for every k, any k‐edge coloring of a sufficiently large Qn contains a monochromatic copy of H. © 2006 Wiley Periodicals, Inc. J Graph Theory 53: 196–208, 2006 相似文献
4.
L. I. Makarov 《Journal of Structural Chemistry》2005,46(4):738-743
Some questions emerged from electronic data processing of molecular structures (graphs) and its fragments have been considered in this work. Quantitative estimations of subgraph positions in molecular graphs are presented and some properties of their maximal common subgraphs are described. 相似文献
5.
A milestone in probability theory is the law of the iterated logarithm (LIL), proved by Khinchin and independently by Kolmogorov in the 1920s, which asserts that for iid random variables with mean 0 and variance 1 In this paper we prove that LIL holds for various functionals of random graphs and hypergraphs models. We first prove LIL for the number of copies of a fixed subgraph H. Two harder results concern the number of global objects: perfect matchings and Hamiltonian cycles. The main new ingredient in these results is a large deviation bound, which may be of independent interest. For random k‐uniform hypergraphs, we obtain the Central Limit Theorem and LIL for the number of Hamilton cycles. 相似文献
6.
7.
The edge‐percolation and vertex‐percolation random graph models start with an arbitrary graph G, and randomly delete edges or vertices of G with some fixed probability. We study the computational complexity of problems whose inputs are obtained by applying percolation to worst‐case instances. Specifically, we show that a number of classical ‐hard problems on graphs remain essentially as hard on percolated instances as they are in the worst‐case (assuming ). We also prove hardness results for other ‐hard problems such as Constraint Satisfaction Problems and Subset‐Sum, with suitable definitions of random deletions. Along the way, we establish that for any given graph G the independence number and the chromatic number are robust to percolation in the following sense. Given a graph G, let be the graph obtained by randomly deleting edges of G with some probability . We show that if is small, then remains small with probability at least 0.99. Similarly, we show that if is large, then remains large with probability at least 0.99. We believe these results are of independent interest. 相似文献
8.
We solve a problem proposed by Jacobson, Kézdy, and Lehel [4] concerning the existence of forbidden induced subgraph characterizations of line graphs of linear k-uniform hypergraphs with sufficiently large minimal edge-degree. Actually, we prove that for each k3 there is a finite set Z(k) of graphs such that each graph G with minimum edge-degree at least 2k2–3k+1 is the line graph of a linear k-uniform hypergraph if and only if G is a Z(k)-free graph.Acknowledgments. We thank the anonymous referees, whose suggestions helped to improve the presentation of the paper.Winter 2002/2003 DIMACS Award is gratefully acknowledged2000 Mathematics Subject Classification: 05C65 (05C75, 05C85) 相似文献
9.
10.
In a sustained development scenario, it is often the case that an investment is to be made over time in facilities that generate benefits. The benefits result from joint synergies between the facilities expressed as positive utilities specific to some subsets of facilities. As incremental budgets to finance fixed facility costs become available over time, additional facilities can be opened. The question is which facilities should be opened in order to guarantee that the overall benefit return over time is on the highest possible trajectory. This problem is common in situations such as ramping up a communication or transportation network where the facilities are hubs or service stations, or when introducing new technologies such as alternative fuels for cars and the facilities are fueling stations, or when expanding the production capacity with new machines, or when facilities are functions in a developing organization that is forced to make choices of where to invest limited funding. 相似文献