Results 41 to 50 of about 5,986,669 (282)

Linear separation of connected dominating sets in graphs

Ars Mathematica Contemporanea, 2019
32 pages, 8 ...
Chiarelli, Nina, Milanič, Martin
openaire   +8 more sources

Minimum connected dominating set algorithm based on directed diffusion

Tongxin xuebao, 2008
A new minimum connected dominating set algorithm based on directed diffusion MCDSDD was proposed, which attempted to improve the existed area coverage algorithms through introducing node’s gradient in wireless sensor networks.
LI Ke-qing, CHANG Jin-yi, WANG Jia-nian
doaj   +2 more sources

Data Aggregation Scheduling Algorithm for Wireless Sensor Network Based on Connected Dominating Set [PDF]

Jisuanji gongcheng, 2016
Data aggregation scheduling aims to find a feasible and efficient data aggregation scheme for Wireless Sensor Network (WSN).Previous algorithms on this problem usually construct data aggregation routing based on shortest-path-trees,which results in data ...
NING Duobiao,ZHANG Bing
doaj   +1 more source

Therapeutic Apheresis in Nigeria: A Multi‐Center Summary of Abstracts From the Inaugural Nigerian Society for Apheresis Scientific Meeting

Therapeutic Apheresis and Dialysis, EarlyView.
ABSTRACT Background Therapeutic apheresis (TA) is an established treatment modality for hematologic, neurologic, and immunologic disorders, yet access remains severely limited in sub‐Saharan Africa. Donor apheresis, including platelet apheresis collection from healthy donors, represents an important complementary modality supporting blood product ...
Nosa Bazuaye, Chimezie Okwuonu, Evelyn Idam, Folasade Adelekan‐Popoola, Shakirat Gold‐Olufadi, Olufunto Olufela Kalejaiye, Abdullateef Ogala, Zinnah Aloziem, Blossom Amamchukwu, Patience Elimia, Mkpoikanabasi Obot‐Obot, Henry Mbakwe, Praises Maduagwuna, Olatunji Akinrodoye, Chiamaka Anyanwu, Benjamin Anyanwu, Adedamola Akinsiku, Oluwatoyin A. Akinsiku, Muzamil O. Hassan, Fatiu A. Arogundade, Olalekan E. Ojo, Homayemem Weli, Jesupelumi Adenihun, Aderemi Adelaja, Ebun Bamgboye, Olalekan Olatise, Ade E. Faponle, Ayoola Odeyemi, Michael Muoka, Stephen Asaolu, Qudrat Busari, Blessing Dawudu, Michael Naiyeju, Rasheed A. Balogun   +33 more
wiley   +1 more source

Enumerating Minimal Connected Dominating Sets

SIAM Journal on Discrete Mathematics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Faisal Abu-Khzam, Henning Fernau, Benjamin Gras, Mathieu Liedloff, Kevin Mann   +4 more
openaire   +3 more sources

A NEWLY PROPOSED COMBINED ROUTING ALGORITHM FOR MANET

International Journal of Intelligent Computing and Information Sciences, 2015
The Connected Dominating Set based routing is a promising approach for enhancing the routing efficiency in wireless Ad hoc networks. Two types of constructing connected dominating strategies exist; the first is the constant performance ratio schemes and ...
Adel El-Kabbany, B Tawfek, Hanafy Ali
doaj   +1 more source

Safety of Daprodustat for the Treatment of Chronic Kidney Disease Anemia: Final Analysis of a Multicenter Postmarketing Surveillance Study in Japan

Therapeutic Apheresis and Dialysis, EarlyView.
ABSTRACT Introduction This final analysis of a multicenter, prospective postmarketing surveillance study evaluated the safety of daprodustat in patients with chronic kidney disease anemia in routine clinical practice in Japan. Methods Patients who initiated daprodustat between September 2020 and July 2022 were registered.
Tadao Akizawa, Kyomi Kanaya, Kiyomi Aizawa, Masanori Onoki, Hirofumi Ozeki, Kazuko Suzuki, Ai Hayashi, Tomohiko Asamura   +7 more
wiley   +1 more source

Enumerating Minimal Vertex Covers and Dominating Sets with Capacity and/or Connectivity Constraints

Algorithms
In this paper, we consider the minimal vertex cover and minimal dominating sets with capacity and/or connectivity constraint enumeration problems. We develop polynomial-delay enumeration algorithms for these problems on bounded-degree graphs.
Yasuaki Kobayashi, Kazuhiro Kurita, Kevin Mann, Yasuko Matsui, Hirotaka Ono   +4 more
doaj   +1 more source

Calpain small subunit homodimerization is robust and calcium‐independent

FEBS Letters, EarlyView.
Calpains dimerize via penta‐EF‐hand (PEF) domains. Using single‐molecule force spectroscopy, we measured the strength and kinetics of PEF–PEF homodimer binding. The interaction is robust, shows a transient conformational step before dissociation, and remains largely insensitive to Ca2+.
Nesha May O. Andoy, Trina Dykstra‐MacPherson, Mathias A. Bell, Peter L. Davies, Ruby May A. Sullan   +4 more
wiley   +1 more source

Weakly convex and convex domination numbers [PDF]

Opuscula Mathematica, 2004
Two new domination parameters for a connected graph \(G\): the weakly convex domination number of \(G\) and the convex domination number of \(G\) are introduced. Relations between these parameters and the other domination parameters are derived.
Magdalena Lemańska
doaj