网络释义 1. 最小基数 OWL2 Web本体语言快速参考指南... ... 最大基数( maximum cardinality)最小基数(minimum cardinality) 全称命题( universal… nkos.lib.szu.edu.cn|基于4个网页 2. 最小基数性 屏东商业技术学院 周国华 14 最小基数性 •最小基数性(minimum cardinality)又称为参与限制 (participating...
For any curve C defined over finite fields q (q=p d ;p:prime), Weil gave an estimate for the cardinality of the set C( q ) of q -rational points of C as ... T Ibukiyama - 《Tohoku Mathematical Journal》 被引量: 51发表: 1993年 Improved upper bounds for the number of rational...
The distance k -domination number \\(\\gamma _k(G)\\) of G is the minimum cardinality of a distance k -dominating set of G . In this paper, we establish an upper bound on the distance k -domination number of a graph in terms of its order, minimum degree and maximum degree. We ...
An instance of simple max cut is an undirected graph G=(V,E) where we look for a cut with the maximum number of edges. We can transform this instance into instances for k-card cut considering the same graph with weight w(e)=1 for all e∈E and values of k between 1 and |E|. ...
二分图的两组节点都是Trip,如果在Vehicle-shareability里邮编,则二分图里也有对应的边。这样的话,path cover问题就转变为 maximum cardinality bipartite matching问题。使用算法在二分图中找到最大匹配后,任选二分图中一个节点集合,其中未匹配的节点数就是最小车队数。详情可参见附录的资料。
In this case, we need (i) to verify that the domination number is in fact γ, and (ii) to identify the non-dominating sets of cardinality γ. Proposition 2.2 For every M≥1 and every γ≥2, let G, |V(G)|=n=Mγ, be the γ-fold lexicographic product of KM. Then γ(G)=γ ...
Facebook Twitter Google Share on Facebook minimum vertex cover [‚min·ə·məm ′vər‚teks ‚kəv·ər] (mathematics) A vertex cover in a graph such that there is no other vertex cover with fewer vertices. McGraw-Hill Dictionary of Scientific & Technical Terms, 6E, Copyri...
where | · | is the cardinality of the bacteria (B) and phages (P), and outd and ind refer to the outdegree and indegree of the nodes, that is, the number of arrows leaving source nodes (phages) or entering target nodes (bacteria), respectively. These equations consider that phages ...
In recent years, structural controllability and control theory approaches have been studied in depth in the context of linear and nonlinear complex systems and networks1,2,3,4. More recently, Liu et al. mapped the structural controllability problem into one that involves solving a maximum matching...
总体思路:minimum fleet -> path cover -> maximum cardinality bipartite matching 轨迹处理 每条出行轨迹简化为四个信息: 起点经纬度 终点经纬度 出发时刻 到达时刻 根据上述信息进行以下几个方面的处理: 地图匹配:使用OSM地图数据,以路口为节点,以道路为边,构建Graph,对起终点经纬度进行Map Matching,目的是抓到定位...