全文获取类型
收费全文 | 96篇 |
免费 | 1篇 |
国内免费 | 7篇 |
专业分类
化学 | 2篇 |
力学 | 1篇 |
综合类 | 1篇 |
数学 | 90篇 |
物理学 | 1篇 |
综合类 | 9篇 |
出版年
2024年 | 1篇 |
2023年 | 1篇 |
2022年 | 5篇 |
2020年 | 5篇 |
2019年 | 5篇 |
2018年 | 1篇 |
2017年 | 2篇 |
2016年 | 1篇 |
2015年 | 1篇 |
2014年 | 3篇 |
2013年 | 9篇 |
2011年 | 4篇 |
2010年 | 9篇 |
2009年 | 9篇 |
2008年 | 4篇 |
2007年 | 4篇 |
2006年 | 13篇 |
2005年 | 2篇 |
2004年 | 5篇 |
2003年 | 2篇 |
2002年 | 4篇 |
2001年 | 2篇 |
2000年 | 2篇 |
1998年 | 5篇 |
1997年 | 1篇 |
1995年 | 1篇 |
1993年 | 1篇 |
1991年 | 1篇 |
1988年 | 1篇 |
排序方式: 共有104条查询结果,搜索用时 15 毫秒
1.
A new family of proximity graphs: Class cover catch digraphs 总被引:1,自引:0,他引:1
Jason DeVinney 《Discrete Applied Mathematics》2006,154(14):1975-1982
Motivated by issues in machine learning and statistical pattern classification, we investigate a class cover problem (CCP) with an associated family of directed graphs—class cover catch digraphs (CCCDs). CCCDs are a special case of catch digraphs. Solving the underlying CCP is equivalent to finding a smallest cardinality dominating set for the associated CCCD, which in turn provides regularization for statistical pattern classification. Some relevant properties of CCCDs are studied and a characterization of a family of CCCDs is given. 相似文献
2.
非负矩阵与有向图的谱半径 总被引:2,自引:0,他引:2
本文给出非负矩阵的谱半径的上界、下界,由此给出有向图的谱半径的界. 相似文献
3.
Maurits de Graaf 《Discrete Mathematics》2004,280(1-3):219-223
We show that each directed graph (with no parallel arcs) on n vertices, each with indegree and outdegree at least n/twhere t=2.888997… contains a directed circuit of length at most 3. 相似文献
4.
Digraph games are cooperative TU-games associated to digraph competitions: domination structures that can be modeled by directed
graphs. Examples come from sports competitions or from simple majority win digraphs corresponding to preference profiles for
a group of individuals within the framework of social choice theory. Brink and Gilles (2000) defined theβ-measure of a digraph competition as the Shapley value of the corresponding digraph game. This paper provides a new characterization
of theβ-measure. 相似文献
5.
We consider a certain combinatorial game on a digraph for two cases of the price function. For one case the game in question extends the cyclical game studied in Ehrenfeucht and Mycielski (1979) and Gurvitch, Karzanov and Khachiyan (1988) which, in its turn, is a generalization of the well-known problem of finding a minimum mean cycle in an edge-weighted digraph. We prove the existence of optimal uniform stationary strategies for both cases and give algorithms to find such strategies.This work was partially supported by Chaire municipale, Mairie de Grenoble. 相似文献
6.
《Discrete Mathematics》2022,345(10):112996
In this paper, we determine the maximum size of digraphs on n vertices which avoid two distinct walks of length 3 with the same initial vertex and the same terminal vertex. The digraphs attaining this maximum size are also characterized. Combining this with previous results, we obtain a full solution to a problem proposed by X. Zhan in 2007. 相似文献
7.
钱建国 《青海师范大学学报(自然科学版)》1991,(1):24-29
本文得到了2-有向循环图 G(a,b,N)与 G(a',b',N)同构的充要条件为:(a,b,N)=(a',b',N)=K且 a'b≡ab'(mod KN);或 a'a≡b'b(mod KN),这里(x,y,z)表示整数 x,y,z 的最大公约数。 相似文献
8.
We consider a new problem of constructing some required structures in digraphs, where all arcs installed in such required structures are supposed to be cut from some pieces of a specific material of length L. Formally, we consider the model: a digraph D = (V, A; w), a structure S and a specific material of length L, where w: A → R+, we are asked to construct a subdigraph D′ from D, having the structure S, such that each arc in D′ is constructed by a part of a piece or/and some whole pieces of such a specific material, the objective is to minimize the number of pieces of such a specific material to construct all arcs in D′. 相似文献
9.
Raymond Bisdorff Patrick Meyer Marc Roubens 《4OR: A Quarterly Journal of Operations Research》2008,6(2):143-165
The main concern of this article is to present the R
UBIS method for tackling the choice problem in the context of multiple criteria decision aiding. Its genuine purpose is to help
a decision maker to determine a single best decision alternative. Methodologically we focus on pairwise comparisons of these
alternatives which lead to the concept of bipolar-valued outranking digraph. The work is centred around a set of five pragmatic
principles which are required in the context of a progressive decision aiding methodology. Their thorough study and implementation
in the outranking digraph lead us to define a choice recommendation as an extension of the classical digraph kernel concept.
相似文献
10.
This paper characterizes directed graphs which are Cayley graphs of strong semilattices of groups and, in particular, strong chains of groups, i.e. of completely regular semigroups which are also called Clifford semigroups. 相似文献