Results 51 to 60 of about 133,936 (292)

Degree-Constrained Minimum Spanning Hierarchies in Graphs

Algorithms
The minimum spanning tree problem in graphs under budget-type degree constraints (DCMST) is a well-known NP-hard problem. Spanning trees do not always exist, and the optimum can not be approximated within a constant factor.
Miklos Molnar
doaj   +1 more source

A quality of system routing based on neighborhood interference detection and mitigation in wireless sensor network

International Journal of Distributed Sensor Networks, 2020
The current quality of system routing available in wireless sensor network mainly provides assurance for traffic flow, with little consideration on full use of network resource, like bandwidth.
Ling Zhang, Ziyun Ni
doaj   +1 more source

EEG Functional Connectivity Underlying Emotional Valance and Arousal Using Minimum Spanning Trees

Frontiers in Neuroscience, 2020
In recent years, traditional methods such as power spectrum and amplitude analysis have been used to research the emotional electroencephalogram (EEG). The brain network method is also used in emotional EEG research, which can better reflect the activity
Rui Cao, Yan Hao, Xin Wang, Yuan Gao, Huiyu Shi, Shoujun Huo, Bin Wang, Hao Guo, Jie Xiang   +8 more
doaj   +1 more source

Spanning trees with generalized degree constraints arising in the design of wireless networks [PDF]

, 2011
In this paper we describe a minimum spanning tree problem with generalized degree constraints which arises in the design of wireless networks. The signal strength on the receiver side of a wireless link decreases with the distance between transmitter and
Gouveia, Luís, Moura, Pedro, Sousa, Amaro de   +2 more
core   +2 more sources

Clinical Practice Guideline for Evaluation and Management of Peripheral Nervous System Manifestations in Sjögren's Disease

Arthritis Care &Research, EarlyView.
Objective Sjögren's disease is an autoimmune disorder that can impact multiple organ systems, including the peripheral nervous system (PNS). PNS manifestations, which can exist concurrently, include mononeuropathies, polyneuropathies, and autonomic nervous system neuropathies.
Anahita Deboo, Robert Fox, Katherine M. Hammitt, Julie Frantsve‐Hawley, Matthew C. Baker, Stamatina Danielides, Eduardo De Sousa, Brent P. Goodman, Jennifer K. King, Steven Mandel, Ghaith Noaiseh, Pantelis P. Pavlakis, George Sarka, R. Hal Scofield, Arun Varadhachary, Daniel J. Wallace, Matt Makara, Nancy Carteron, Steven Carsons, in collaboration with the Consensus Expert Panel (CEP) members, G. Alden Adkins, Brittany Adler, Hossein Ansari, Senada Arabelovic, Alan Baer, Denis Balaban, Shamik Bhattacharyya, Evelyn Bromet, Krishna Chaganti, Kamal Chemali, Melissa Cortez, Schartess Culpepper, Paul Dellaripa, Dana Direnzo, Daniel El Bogdadi, Robert Fearon, Mehrnez Fischbach, Judi Furlong, Christopher Gibbons, Rachael Gordon, Thomas Grader Beck, Syed Haider, Larry Hollenbeck, Chadwick R. Johr, Stuart S. Kassan, Brian King, Octavia Kincaid, Eugene Kissin, Vasileios Kyttaris, Lindsay Lally, Brandon M. Law, Janet Lewis, Scott M. Lieberman, Amanda Lusa, Joseph Lutt, Rashmi Maganti, Arthur M. Mandelin, Sara McCoy, Kerry Neall, Timothy Niewold, Anne Louise Oaklander, Ruben A. Peredo‐Wende, Lynn Petruzzi, Mark A. Porter, Guada Respicio Duque, Tania Reyna, Nathaniel M. Robbins, Elliot D. Rosenstein, Laura Rosow, Breanna Ruthrauff, Amit Sachdev, Nora Sandorfi, Sarah Schafer, Elena Schiopu, Chokkalingam Siva, Daniel Small, Sara M. Stern, Lauren Stiles, Susan Stoddard, Jinny Tavee, Donald Thomas, Edward L. Treadwell, Nagagopal Venna, Steven Vernino, Frederick B. Vivino, Brittany Weber, Sepideh Yadollahi, Huiying Yu, Scott Zashin   +88 more
wiley   +1 more source

A 1.5-Approximation for Symmetric Euclidean Open Loop TSP

IEEE Access
Travelling Salesman Problem (TSP) is NP-hard and therefore lacks efficient algorithm that provides optimal solution. So far, a benchmark in this area is Christofides’ Algorithm, which provides an upper bound of 3/2 for metric TSP.
Alok Chauhan
doaj   +1 more source

Bounds on the radius and status of graphs [PDF]

, 2014
Two classical concepts of centrality in a graph are the median and the center. The connected notions of the status and the radius of a graph seem to be in no relation.
Burkard, Rainer E., Rissner, Roswitha
core   +1 more source

Air‐Pressure–Actuated Vibroacoustic Metamaterial With Tunable Bandgap: Design, Modeling, and Characterization

Advanced Engineering Materials, EarlyView.
This article presents the design, modeling, and characterization of air‐pressure–actuated programmable vibroacoustic metamaterials (PVAMM). The study focuses on leveraging air pressure to dynamically tune resonance frequencies for effective noise attenuation.
William Kaal, Michael M. Becker, Sarah C. L. Fischer   +2 more
wiley   +1 more source

Degree-Constrained Steiner Problem in Graphs with Capacity Constraints

Mathematics
The degree-constrained Steiner problem in graphs is well known in the literature. In an undirected graph, positive integer degree bounds are associated with nodes and positive costs with the edges.
Miklos Molnar
doaj   +1 more source

Brief Announcement: Memory Lower Bounds for Self-Stabilization [PDF]

, 2019
In the context of self-stabilization, a silent algorithm guarantees that the communication registers (a.k.a register) of every node do not change once the algorithm has stabilized. At the end of the 90\u27s, Dolev et al. [Acta Inf.
, Feuilloley, Laurent, Le Bouder, Gabriel   +2 more
core   +1 more source