Results 41 to 50 of about 1,312,788 (294)
A Graph-Theoretic and Stochastic Analysis of BLE-Assisted Cooperative Wi-Fi Scanning
Wi-Fi stations (STAs) repeatedly scan channels to maintain access-point information, but a conventional full Wi-Fi scan incurs substantial delay and energy overhead.
Jonghun Han, Hongchan Kim
doaj +1 more source
Reorientations of covering graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graham R. Brightwell, Jaroslav Nesetril
openaire +2 more sources
A Novel SAT-Based Approach to the Task Graph Cost-Optimal Scheduling Problem [PDF]
The Task Graph Cost-Optimal Scheduling Problem consists in scheduling a certain number of interdependent tasks onto a set of heterogeneous processors (characterized by idle and running rates per time unit), minimizing the cost of the entire process. This
Sergio Nocco +3 more
core +1 more source
Some Covering and Packing Problems for Mixed Triples
A mixed graph has both edges and directed edges (or “arcs”). A complete mixed graph on v vertices, denoted Mv, has, for every pair of vertices u and v, an edge {u,v}, an arc (u,v), and an arc (v,u).
Benkam Bobga, Robert Gardner
doaj +1 more source
Two constructions of -antimagic graphs
Let be a graph. A graph admits an -covering if every edge in belongs to a subgraph of isomorphic to . A graph admitting an -covering is called --antimagic if there is a bijection such that for each subgraph of isomorphic to , the sum of labels of all the
Andrea Semaničová-Feňovčíková +2 more
doaj +1 more source
The authors study coverings of non-bipartite graphs by bipartite graphs. In particular, they enumerate regular bipartite coverings for orders which are twice a prime.
Archdeacon, D +3 more
openaire +3 more sources
From mice to humans—divergent strategies for intestinal homeostasis and regeneration
Recent advances such as organoid genome editing, xenotransplantation, imaging, and whole‐genome sequencing have enabled direct studies of human intestinal stem cells (ISCs). These studies reveal species‐specific features, including slower ISC proliferation, distinct injury responses, slower somatic mutation accumulation in humans, and an inverse ...
Keiko Ishikawa +2 more
wiley +1 more source
Matching Number, Independence Number, and Covering Vertex Number of Γ(Zn)
Graph invariants are the properties of graphs that do not change under graph isomorphisms, the independent set decision problem, vertex covering problem, and matching number problem are known to be NP-Hard, and hence it is not believed that there are ...
Eman AbuHijleh +3 more
doaj +1 more source
Modelling stem cell differentiation related processes—A practical overview for biologists
Stem cell differentiation is complex and difficult to control experimentally. This review introduces suitable computational modelling approaches that can support stem cell research, from mechanistic ODE and abstract models to multiscale and deep learning methods.
Ricco Zeegelaar +4 more
wiley +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Karen Meagher, Brett Stevens
openaire +2 more sources

