全文获取类型
收费全文 | 257篇 |
免费 | 26篇 |
国内免费 | 9篇 |
专业分类
化学 | 10篇 |
力学 | 1篇 |
综合类 | 2篇 |
数学 | 272篇 |
物理学 | 7篇 |
出版年
2024年 | 1篇 |
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篇 |
排序方式: 共有292条查询结果,搜索用时 15 毫秒
21.
Anne Berry 《Discrete Mathematics》2006,306(3):318-336
For a chordal graph G=(V,E), we study the problem of whether a new vertex u∉V and a given set of edges between u and vertices in V can be added to G so that the resulting graph remains chordal. We show how to resolve this efficiently, and at the same time, if the answer is no, specify a maximal subset of the proposed edges that can be added along with u, or conversely, a minimal set of extra edges that can be added in addition to the given set, so that the resulting graph is chordal. In order to do this, we give a new characterization of chordal graphs and, for each potential new edge uv, a characterization of the set of edges incident to u that also must be added to G along with uv. We propose a data structure that can compute and add each such set in O(n) time. Based on these results, we present an algorithm that computes both a minimal triangulation and a maximal chordal subgraph of an arbitrary input graph in O(nm) time, using a totally new vertex incremental approach. In contrast to previous algorithms, our process is on-line in that each new vertex is added without reconsidering any choice made at previous steps, and without requiring any knowledge of the vertices that might be added subsequently. 相似文献
22.
子图识别问题(SRP)就是在一个图G中确定并寻找是否存在和另一个图H相同构的子图.本文将引入图的层分解概念,并以此为基础建立识别图的同构子图的算法.该算法的复杂性为O(n(△-1)^k-1),其中△是图G的度,即G中点的最大度,n,k分别是图G,H的阶. 相似文献
23.
David R. Wood 《Graphs and Combinatorics》2007,23(3):337-352
A clique is a set of pairwise adjacent vertices in a graph. We determine the maximum number of cliques in a graph for the following
graph classes: (1) graphs with n vertices and m edges; (2) graphs with n vertices, m edges, and maximum degree Δ; (3) d-degenerate graphs with n vertices and m edges; (4) planar graphs with n vertices and m edges; and (5) graphs with n vertices and no K5-minor or no K3,3-minor. For example, the maximum number of cliques in a planar graph with n vertices is 8(n − 2).
Research supported by a Marie Curie Fellowship of the European Community under contract 023865, and by the projects MCYT-FEDER
BFM2003-00368 and Gen. Cat 2001SGR00224. 相似文献
24.
在文献[2]中作者定义了图的一种新分解-升分解(Ascending subgraph Decomposition简记为ASD),并提出了一个猜想:任意有正数条边的图都可以升分解.本文主要证明了二部图Km1m2-Hm2(m1≥m2)可以升分解,其中Hm2是至多含m2条边的Km1m2的子图. 相似文献
25.
We consider random subgraphs of a fixed graph with large minimum degree. We fix a positive integer k and let Gk be the random subgraph where each independently chooses k random neighbors, making kn edges in all. When the minimum degree then Gk is k‐connected w.h.p. for ; Hamiltonian for k sufficiently large. When , then Gk has a cycle of length for . By w.h.p. we mean that the probability of non‐occurrence can be bounded by a function (or ) where . © 2016 Wiley Periodicals, Inc. Random Struct. Alg., 50, 143–157, 2017 相似文献
26.
Maria Chudnovsky Louis Esperet Laetitia Lemoine Peter Maceli Frédéric Maffray Irena Penev 《Journal of Graph Theory》2017,84(3):221-232
We prove that a graph G contains no induced ‐vertex path and no induced complement of a ‐vertex path if and only if G is obtained from 5‐cycles and split graphs by repeatedly applying the following operations: substitution, split unification, and split unification in the complement, where split unification is a new class‐preserving operation introduced here. 相似文献
27.
图模式挖掘中的子图同构算法 总被引:1,自引:0,他引:1
图模式挖掘问题在Web挖掘、生物信息学、社会关系等众多领域有广泛的应用,它涉及到子图的搜索以及子图的同构问题.这两个问题都具有相当高的计算复杂度,现有的子图同构问题大多采用最小编码算法,但对无标签图特别是对无标签无向图,该算法效率较底,从而子图的同构成为图模式挖掘问题的一个瓶颈.针对无标签图,以代数理论为基础,分别利用度序列和特征值构造了两种子图同构算法,用于对有向图和无向图的同构判别.最后对2个真实生物网络进行了仿真实验,结果表明,算法的效率优于现有算法. 相似文献
28.
Edge-Colorings with No Large Polychromatic Stars 总被引:1,自引:0,他引:1
Tao Jiang 《Graphs and Combinatorics》2002,18(2):303-308
Given a graph G and a positive integer r, let f
r
(G) denote the largest number of colors that can be used in a coloring of E(G) such that each vertex is incident to at most r colors. For all positive integers n and r, we determine f
r
(K
n,n
) exactly and f
r
(K
n
) within 1. In doing so, we disprove a conjecture by Manoussakis, Spyratos, Tuza and Voigt in [4].
Received: May 17, 1999 Final version received: January 12, 2000 相似文献
29.
一个实矩阵的符号稳定性问题在经济学、生态学等诸多领域中都有应用背景.本文利用[1]中给出的不可约矩阵的符号稳定性的有关结论,将一个实矩阵的符号稳定性判定问题转化为一个等价的图论问题,即判定无向树中一个点子集的稳定性问题.本文引入了树的稳定子集的概念并给出了稳定子集的递归判别方法.本文还提出井研究了树的稳定指标,即树中所有稳定子集的最小基数,证明了关于稳定指标的一个min—max型定理,井给出了n阶树的稳定指标的最好上界及达到上界的极树的完全刻划。 相似文献
30.
By Petersen's theorem, a bridgeless cubic multigraph has a 2-factor. Fleischner generalised this result to bridgeless multigraphs of minimum degree at least three by showing that every such multigraph has a spanning even subgraph. Our main result is that every bridgeless simple graph with minimum degree at least three has a spanning even subgraph in which every component has at least four vertices. We deduce that if G is a simple bridgeless graph with n vertices and minimum degree at least three, then its line graph has a 2-factor with at most max{1,(3n-4)/10} components. This upper bound is best possible. 相似文献