I have to construct a few things before I get to my question: it's possible we don't need all of it, but I am stuck on the very last step so I should recap everything so far.Let κκ be a singular cardinal with cfκ=λ>ωcfκ=λ>ω, and let ...
An algorithm for finding a maximal cutset of the WLFG is given such that (1) a maximal cutset does not contain two arcs that lie on a single path of the WLFG, and (2) its capacity is equal to the cardinality of a minimal set of base paths of the program. The algorithm ...
A dominating set D of an undirected graph G is a set of vertices such that every vertex not in D is adjacent to at least one vertex in D . Given a undirected graph G , the minimal cardinality dominating set problem is to find a dominating set of G with minimum number of vertices. ...
The restriction on generator set cardinality is the best possible, as the problem becomes soluble in polynomial time if the generator set contains only one permutation. Some restricted versions of the problem, in which the generator set is fixed rather than being part of the problem instance, ...
Let V, E, and D denote the cardinality of the vertex set, the cardinality of the edge set, and the maximum degree of a bipartite multigraph G. We s... KO Richard Cole,S Schirra - 《Combinatorica》 被引量: 71发表: 2001年 Superconducting transition temperatures in the Ru-1232 system...
A unique identifier for this set of audit findings. This identifier is used to apply mitigation tasks to one or more sets of findings. Type: String Length Constraints: Minimum length of 1. Maximum length of 128. Pattern: [a-zA-Z0-9_-]+ Required: No findingTime The time the result ...
apeptid -dna(from fish)origin-france peptid -脱氧核糖核酸(从鱼)起源法国 [translate] a4456 BT Lewedorp 4456 BT Lewedorp [translate] a其出土的太阳神鸟金箔是中国文化遗产标志 Its unearthed solar phoenix gold foil is the China cultural heritage symbol [translate] aMaximal cardinality of linearly ...
of cardinality s , let d s ( i , j ) be the set of 2 s -nuclei of g with node set { x i | i ∈ i } ∪ { r j | j ∈ j }. then $$ p_{a,z} = \sum_{i,j\subseteq \{1,\dots,n\}} \sum_{d \in d_{s}(i,j)} \sigma(d)\ell(d), $$ ((16)) where ...
The paper surveys the techniques used for designing the most efficient algorithms for finding a maximal (cardinality or weighted) matching in (general or bipartite) graphs. It also lists some open problems concerning possible improvements and the existence of fast parallel algorithms for these problems...
We present a linear expected time algorithm for finding maximum cardinality matchings in sparse random graphs. This is optimal and improves on previous results by a logarithmic factor. 1 Introduction A matching M in a graph G = (V, E) is a set of vertex disjoint edges. The problem of ...