全文获取类型
收费全文 | 259篇 |
免费 | 25篇 |
国内免费 | 9篇 |
专业分类
化学 | 10篇 |
力学 | 1篇 |
综合类 | 2篇 |
数学 | 273篇 |
物理学 | 7篇 |
出版年
2024年 | 2篇 |
2023年 | 8篇 |
2022年 | 8篇 |
2021年 | 3篇 |
2020年 | 17篇 |
2019年 | 11篇 |
2018年 | 11篇 |
2017年 | 14篇 |
2016年 | 8篇 |
2015年 | 6篇 |
2014年 | 7篇 |
2013年 | 18篇 |
2012年 | 6篇 |
2011年 | 12篇 |
2010年 | 15篇 |
2009年 | 29篇 |
2008年 | 10篇 |
2007年 | 13篇 |
2006年 | 18篇 |
2005年 | 5篇 |
2004年 | 7篇 |
2003年 | 7篇 |
2002年 | 14篇 |
2001年 | 5篇 |
2000年 | 6篇 |
1999年 | 11篇 |
1998年 | 7篇 |
1997年 | 5篇 |
1996年 | 2篇 |
1995年 | 1篇 |
1993年 | 3篇 |
1992年 | 1篇 |
1990年 | 2篇 |
1989年 | 1篇 |
排序方式: 共有293条查询结果,搜索用时 15 毫秒
91.
Finding the building blocks of real-world networks contributes to the understanding of their formation process and related dynamical processes, which is related to prediction and control tasks. We explore different types of social networks, demonstrating high structural variability, and aim to extract and see their minimal building blocks, which are able to reproduce supergraph structural and dynamical properties, so as to be appropriate for diffusion prediction for the whole graph on the base of its small subgraph. For this purpose, we determine topological and functional formal criteria and explore sampling techniques. Using the method that provides the best correspondence to both criteria, we explore the building blocks of interest networks. The best sampling method allows one to extract subgraphs of optimal 30 nodes, which reproduce path lengths, clustering, and degree particularities of an initial graph. The extracted subgraphs are different for the considered interest networks, and provide interesting material for the global dynamics exploration on the mesoscale base. 相似文献
92.
Martin Milanič 《Journal of Graph Theory》2013,73(4):400-424
An efficient dominating set (or perfect code) in a graph is a set of vertices the closed neighborhoods of which partition the graph's vertex set. We introduce graphs that are hereditary efficiently dominatable in that sense that every induced subgraph of the graph contains an efficient dominating set. We prove a decomposition theorem for (bull, fork, C4)‐free graphs, based on which we characterize, in terms of forbidden induced subgraphs, the class of hereditary efficiently dominatable graphs. We also give a decomposition theorem for hereditary efficiently dominatable graphs and examine some algorithmic aspects of such graphs. In particular, we give a polynomial time algorithm for finding an efficient dominating set (if one exists) in a class of graphs properly containing the class of hereditary efficiently dominatable graphs by reducing the problem to the maximum weight independent set problem in claw‐free graphs. 相似文献
93.
Detecting epistatic interactions, or nonlinear interactive effects of Single Nucleotide Polymorphisms (SNPs), has gained increasing attention in explaining the “missing heritability” of complex diseases. Though much work has been done in mapping SNPs underlying diseases, most of them constrain to 2-order epistatic interactions. In this paper, a method of hypergraph construction and high-density subgraph detection, named HC-HDSD, is proposed for detecting high-order epistatic interactions. The hypergraph is constructed by low-order epistatic interactions that identified using the normalized co-information measure and the exhaustive search. The hypergraph consists of two types of vertices: real ones representing main effects of SNPs and virtual ones denoting interactive effects of epistatic interactions. Then, both maximal clique centrality algorithm and near-clique mining algorithm are employed to detect high-density subgraphs from the constructed hypergraph. These high-density subgraphs are inferred as high-order epistatic interactions in the HC-HDSD. Experiments are performed on several simulation data sets, results of which show that HC-HDSD is promising in inferring high-order epistatic interactions while substantially reducing the computation cost. In addition, the application of HC-HDSD on a real Age-related Macular Degeneration (AMD) data set provides several new clues for the exploration of causative factors of AMD. 相似文献
94.
95.
Jian Xin Wei 《数学学报(英文版)》2017,33(6):851-860
Generalized Fibonacci cube Q_d(f), introduced by Ilic, Klavzar and Rho, is the graph obtained from the hypercube Q_d by removing all vertices that contain f as factor. A word f is good if Q_d(f) is an isometric subgraph of Q_d for all d ≥ 1, and bad otherwise. A non-extendable sequence of contiguous equal digits in a word μ is called a block of μ. Ilic, Klavzar and Rho shown that all the words consisting of one block are good, and all the words consisting of three blocks are bad. So a natural problem is to study the words consisting of other odd number of blocks. In the present paper,a necessary condition for a word consisting of odd number of blocks being good is given, and all the good(bad) words consisting of 5 blocks is determined. 相似文献
96.
97.
98.
§1 IntroductionLet Pn,Cn,and Kn be the path,the cycle,and the complete graph of order n,respectively.The complete bipartite graph with cardinalities ofparts m and n is denoted byKm,n.Disjoint union of n copies of a graph G is denoted by n G;Gis the complement of agraph G.A setof pairwise non-adjacent vertices in a graph is called stable.A maximum stableset of a graph G has the largest cardinalityα( G) among all stable sets of G;α( G) is calledthe stability number of G.Let Z be a s… 相似文献
99.
Vladimir Nikiforov 《Journal of Graph Theory》2009,62(4):362-368
In this note we strengthen the stability theorem of Erd?s and Simonovits. Write Kr(s1, …, sr) for the complete r‐partite graph with classes of sizes s1, …, sr and Tr(n) for the r‐partite Turán graph of order n. Our main result is: For all r≥2 and all sufficiently small c>0, ε>0, every graph G of sufficiently large order n with e(G)>(1?1/r?ε)n2/2 satisfies one of the conditions:
- (a) G contains a $K_{r+1} (\lfloor c\,\mbox{ln}\,n \rfloor,\ldots,\lfloor c\,\mbox{ln}\,n \rfloor,\lceil n^{{1}-\sqrt{c}}\rceil)
In this note we strengthen the stability theorem of Erd?s and Simonovits. Write Kr(s1, …, sr) for the complete r‐partite graph with classes of sizes s1, …, sr and Tr(n) for the r‐partite Turán graph of order n. Our main result is: For all r≥2 and all sufficiently small c>0, ε>0, every graph G of sufficiently large order n with e(G)>(1?1/r?ε)n2/2 satisfies one of the conditions: - (a) G contains a $K_{r+1} (\lfloor c\,\mbox{ln}\,n \rfloor,\ldots,\lfloor c\,\mbox{ln}\,n \rfloor,\lceil n^{{1}-\sqrt{c}}\rceil)$;
- (b) G differs from Tr(n) in fewer than (ε1/3+c1/(3r+3))n2 edges.
- (a) G contains a $K_{r+1}(\lfloor c\,\mbox{ln}\,n\rfloor,\ldots,\lfloor c\,\mbox{ln}\,n\rfloor,\lceil n^{1-\sqrt{c}}\rceil)$;
- (b) G differs from Tr(n) in fewer than (ε1/4+c1/(8r+8))n2 edges.
100.
Thomassen recently proved, using the Tutte cycle technique, that if G is a 3-connected cubic triangle-free planar graph then G contains a bipartite subgraph with at least edges, improving the previously known lower bound . We extend Thomassen’s technique and further improve this lower bound to . 相似文献