全文获取类型
收费全文 | 167篇 |
免费 | 41篇 |
国内免费 | 9篇 |
专业分类
化学 | 1篇 |
综合类 | 1篇 |
数学 | 209篇 |
物理学 | 6篇 |
出版年
2023年 | 10篇 |
2022年 | 6篇 |
2021年 | 9篇 |
2020年 | 16篇 |
2019年 | 12篇 |
2018年 | 17篇 |
2017年 | 9篇 |
2016年 | 11篇 |
2015年 | 10篇 |
2014年 | 7篇 |
2013年 | 10篇 |
2012年 | 5篇 |
2011年 | 11篇 |
2010年 | 12篇 |
2009年 | 13篇 |
2008年 | 11篇 |
2007年 | 7篇 |
2006年 | 8篇 |
2005年 | 6篇 |
2004年 | 2篇 |
2003年 | 5篇 |
2002年 | 3篇 |
2001年 | 6篇 |
2000年 | 2篇 |
1999年 | 3篇 |
1998年 | 1篇 |
1997年 | 1篇 |
1993年 | 1篇 |
1990年 | 1篇 |
1985年 | 1篇 |
1983年 | 1篇 |
排序方式: 共有217条查询结果,搜索用时 93 毫秒
1.
2.
3.
A weighting of the edges of a hypergraph is called vertex‐coloring if the weighted degrees of the vertices yield a proper coloring of the graph, i.e. every edge contains at least two vertices with different weighted degrees. In this article, we show that such a weighting is possible from the weight set for all hypergraphs with maximum edge size and not containing edges solely consisting of identical vertices. The number is best possible for this statement. 相似文献
4.
5.
An Euler tour of a hypergraph (also called a rank‐2 universal cycle or 1‐overlap cycle in the context of designs) is a closed walk that traverses every edge exactly once. In this paper, using a graph‐theoretic approach, we prove that every triple system with at least two triples is eulerian, that is, it admits an Euler tour. Horan and Hurlbert have previously shown that for every admissible order >3, there exists a Steiner triple system with an Euler tour, while Dewar and Stevens have proved that every cyclic Steiner triple system of order >3 and every cyclic twofold triple system admits an Euler tour. 相似文献
6.
7.
8.
In this paper, we are interested in the following question: given an arbitrary Steiner triple system on vertices and any 3‐uniform hypertree on vertices, is it necessary that contains as a subgraph provided ? We show the answer is positive for a class of hypertrees and conjecture that the answer is always positive. 相似文献
9.
Bollobás, Reed, and Thomason proved every 3‐uniform hypergraph ? with m edges has a vertex‐partition V()=V1?V2?V3 such that each part meets at least edges, later improved to 0.6m by Halsegrave and improved asymptotically to 0.65m+o(m) by Ma and Yu. We improve this asymptotic bound to , which is best possible up to the error term, resolving a special case of a conjecture of Bollobás and Scott. 相似文献
10.
《Optimization》2012,61(3):413-427
The hypergraph minimum bisection (HMB) problem is the problem of partitioning the vertices of a hypergraph into two sets of equal size so that the total weight of hyperedges crossing the sets is minimized. HMB is an NP-hard problem that arises in numerous applications – for example, in digital circuit design. Although many heuristics have been proposed for HMB, there has been no known mathematical program that is equivalent to HMB. As a means of shedding light on HMB, we study the equivalent, complement problem of HMB (called CHMB), which attempts to maximize the total weight of non-crossing hyperedges. We formulate CHMB as a quadratically constrained quadratic program, considering its semidefinite programming relaxation and providing computational results on digital circuit partitioning benchmark problems. We also provide results towards an approximation guarantee for CHMB. 相似文献