Results 21 to 30 of about 4,979,723 (296)
Pinch Analysis Approach for Segregated Targeting Networks with Forbidden Matches
Chemical Engineering Transactions, 2022 Conservation of different resources is an important prerequisite toward overall sustainable development. Pinch Analysis has evolved over the years to address resource conservations in various resource allocation networks (RANs).
Sheetal Jain +3 more
doaj +1 more source
Set Families with a Forbidden Subposet [PDF]
The Electronic Journal of Combinatorics, 2009 We asymptotically determine the size of the largest family $\cal F$ of subsets of $\{1,\dots,n\}$ not containing a given poset $P$ if the Hasse diagram of $P$ is a tree. This is a qualitative generalization of several known results including Sperner's theorem.
openaire +3 more sources
Journal of Difference Equations and Applications, 2015 In recent literature there are an increasing number of papers where the forbidden sets of difference equations are computed. We review and complete different attempts to describe the forbidden set and propose new perspectives for further research and a list of open problems in this field.
Balibrea, Francisco, Cascales, Antonio
openaire +2 more sources
Tree in forbidden triples generating a finite set of graphs with high connectivity
AKCE International Journal of Graphs and Combinatorics, 2020 For a graph and a set of connected graphs, is said be -free if does not contain any member of as an induced subgraph. For , we let denote the set of all -connected -free graphs.
Yoshimi Egawa, Zhixian Zhao
doaj +1 more source
Compact Forbidden-Set Routing [PDF]
, 2007 We study labelling schemes for X-constrained path problems. Given a graph (V,E) and X ⊆ V, a path is X-constrained if all intermediate vertices avoid X. We study the problem of assigning labels J(x) to vertices so that given {J(x) : x ∈ X} for any X ⊆ V, we can route on the shortest X-constrained path between x, y ∈ X.
Bruno Courcelle, Andrew Twigg
openaire +1 more source
Non-blocking supervisory control for initialised rectangular automata [PDF]
, 2004 We consider the problem of supervisory control for a class of rectangular automata and more specifically for compact rectangular automata with uniform rectangular activity, i.e. initialised.
Spathopoulos, Michael P.
core +3 more sources
IEEE Access, 2020 The phenomenon of crossing the forbidden zone is unavoidable and wasteful when scheduling the hydro units. In this paper, the effect of crossing the forbidden zone is taken into account using the strategic offering model to help the price-maker hydro ...
Chen Zhang, Wei Yan
doaj +1 more source
Set families with a forbidden pattern
European Journal of Combinatorics, 2017 15 ...
Ilan Karpas, Eoin Long
openaire +4 more sources
Cops and robbers on graphs with a set of forbidden induced subgraphs [PDF]
Theoretical Computer Science, 2020 It is known that the class of all graphs not containing a graph $H$ as an induced subgraph is cop-bounded if and only if $H$ is a forest whose every component is a path. In this study, we characterize all sets $\mathscr{H}$ of graphs with some $k\in \mathbb{N}$ bounding the diameter of members of $\mathscr{H}$ from above, such that $\mathscr{H}$-free ...
Masood Masjoody, Ladislav Stacho
openaire +4 more sources
Samples of geometric random variables with multiplicity constraints [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 We investigate the probability that a sample $\Gamma=(\Gamma_1,\Gamma_2,\ldots,\Gamma_n)$ of independent, identically distributed random variables with a geometric distribution has no elements occurring exactly $j$ times, where $j$ belongs to a specified
Margaret Archibald, Arnold Knopfmacher
doaj +1 more source