نتایج جستجو برای: complete l preordered set
تعداد نتایج: 1544075 فیلتر نتایج به سال:
We study some counting and enumeration problems for chordal graphs, especially concerning independent sets. We first provide the following efficient algorithms for a chordal graph: (1) a linear-time algorithm for counting the number of independent sets; (2) a linear-time algorithm for counting the number of maximum independent sets; (3) a polynomial-time algorithm for counting the number of ind...
This contribution addresses the synthesis of supervisory control for hybrid systems with discrete external signals. Such systems are in general neither l-complete nor can they be represented by nite state machines. We nd an l-complete approximation (abstraction) l for , represent it by a nite state machine, and investigate the control problem for the approximation. If a solution exists, we synt...
This contribution deals with the synthesis of supervisory control for hybrid systems with discrete external signals. Such systems are in general neither l-complete nor representable by nite state machines. We nd the strongest l-complete approximation (abstraction) l for , represent it by a nite state machine , and investigate the control problem for the approximation. If a solution exists, we s...
the set of all non-increasing non-negative integer sequences $pi=(d_1, d_2,ldots,d_n)$ is denoted by $ns_n$. a sequence $piin ns_{n}$ is said to be graphic if it is the degree sequence of a simple graph $g$ on $n$ vertices, and such a graph $g$ is called a realization of $pi$. the set of all graphic sequences in $ns_{n}$ is denoted by $gs_{n}$. the complete product split graph on $l ...
let g=(v,e) be a graph with vertex set v and edge set e.for two vertices u,v of g ,the closed interval i[u,v] ,consists of u,v and all vertices lying in some u-v geodesic in g.if s is a set of vertices of g then i[s]is the union of all sets i[u,v]for u,v ? s. if i[s]=v(g) , then s is a geodetic set for g.the geodetic number g(g) is the minimum cardinality of geodetic set.the maximum cardinalit...
We study some counting and enumeration problems for chordal graphs, especially concerning independent sets. We first provide the following efficient algorithms for a chordal graph: (1) a linear-time algorithm for counting the number of independent sets; (2) a linear-time algorithm for counting the number of maximum independent sets; (3) a polynomial-time algorithm for counting the number of ind...
in order to estimate effects of drought stress on dry matter allocation of pinto bean (phaseolus vulgaris l.), an experiment was carried out as split plot based on complete randomized block design with four replications at zanjan university research farm. in this experiment, two irrigation levels (optimum irrigation during growth season and post flowering drought stress) were set at main plots...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید