Results 61 to 70 of about 124,717 (298)
Connectivity of Graphs Induced by Directional Antennas [PDF]
, 2010 This paper addresses the problem of finding an orientation and a minimum radius for directional antennas of a fixed angle placed at the points of a planar set S, that induce a strongly connected communication graph. We consider problem instances in which
Damian, Mirela, Flatland, Robin
core
Advanced Healthcare Materials, EarlyView.This study introduces an innovative approach to treating intervertebral disc degeneration using ultrasound‐triggered in situ hydrogel formation. Proof‐of‐concept experiments using optimized biomaterial and ultrasound parameters demonstrate partial restoration of biomechanical function and successful integration into degenerated disc tissue, offering a ...
Veerle A. Brans +11 more
wiley +1 more source
Black holes, complex curves, and graph theory: Revising a conjecture by Kasner
Nuclear Physics BThe ratios 8/9=22/3≈0.9428 and 3/2≈0.866 appear in various contexts of black hole physics, as values of the charge-to-mass ratio Q/M or the rotation parameter a/M for Reissner-Nordström and Kerr black holes, respectively.
Yen Chin Ong
doaj +1 more source
Analytical results on Connected dominating sets in mobile ad hoc networks [PDF]
, 2004 We provide analytical results about the performance of various Connected Dominating Set (CDS) algorithms: MultiPoint Relaying (MPR) flooding, MPR-CDS, Generalized Wu Li CDS (GWL-CDS).
Jacquet, Philippe
core +1 more source
An Order-based Algorithm for Minimum Dominating Set with Application in Graph Mining
, 2017 Dominating set is a set of vertices of a graph such that all other vertices have a neighbour in the dominating set. We propose a new order-based randomised local search (RLS$_o$) algorithm to solve minimum dominating set problem in large graphs ...
Chalupa, David
core +1 more source
Total Domination in Unit Disk Graphs
, 2020 Let $G=(V,E)$ be an undirected graph. We call $D_t \subseteq V$ as a total dominating set (TDS) of $G$ if each vertex $v \in V$ has a dominator in $D$ other than itself. Here we consider the TDS problem in unit disk graphs, where the objective is to find a minimum cardinality total dominating set for an input graph.
Jena, Sangram K., Das, Gautam K.
openaire +2 more sources
Geometrically Tunable Scaffold‐Free Muscle Bioconstructs for Treating Volumetric Muscle Loss
Advanced Healthcare Materials, EarlyView.Volumetric muscle loss is associated with traumatic muscle resulting in permanent functional impairment. Mold‐based, scaffold‐free, high‐density muscle tissue bioconstructs are developed in customizable geometric shapes and sizes. The transplanted rectangular solid‐shaped muscle bioconstructs improved muscle force recovery and tissue regeneration in ...
Bugra Ayan +8 more
wiley +1 more source
Directed Random Walk on the Lattices of Genus Two
, 2011 The object of the present investigation is an ensemble of self-avoiding and directed graphs belonging to eight-branching Cayley tree (Bethe lattice) generated by the Fucsian group of a Riemann surface of genus two and embedded in the Pincar\'e unit disk.
A. V. NAZARENKO +4 more
core +1 more source
Bioprinting Organs—Science or Fiction?—A Review From Students to Students
Advanced Healthcare Materials, EarlyView.Bioprinting artificial organs has the potential to revolutionize the medical field. This is a comprehensive review of the bioprinting workflow delving into the latest advancements in bioinks, materials and bioprinting techniques, exploring the critical stages of tissue maturation and functionality.
Nicoletta Murenu +18 more
wiley +1 more source
Solving optimization problems with local light-shift encoding on Rydberg quantum annealers
Physical Review ResearchWe provide a non-unit-disk framework to solve combinatorial optimization problems such as maximum cut and maximum independent set on a Rydberg quantum annealer. Our setup consists of a many-body interacting Rydberg system where locally controllable light
Kapil Goswami +3 more
doaj +1 more source