Results 51 to 60 of about 124,454 (161)
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
Minimum Bisection Is NP-hard on Unit Disk Graphs [PDF]
Information and Computation, 2014 17 pages, 6 ...
Díaz Cort, Josep, Mertzios, George B.
openaire +8 more sources
Matrix-graphic simulation of social network: ergodic properties
Sistemnì Doslìdženâ ta Informacìjnì TehnologìïWe propose mathematical tools for social network simulation to obtain sufficient conditions for network ergodicity, defined as the existence of a steady state as time approaches infinity.
Igor Spectorsky +2 more
doaj +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
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
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
Weak Unit Disk and Interval Representation of Graphs [PDF]
, 2016 We study a variant of intersection representations with unit balls: unit disks in the plane and unit intervals on the line. Given a planar graph and a bipartition of the edges of the graph into near and far edges, the goal is to represent the vertices of the graph by unit-size balls so that the balls for two adjacent vertices intersect if and only if ...
Alam, M. J. +3 more
openaire +2 more sources
Design and Simulation Analysis of Underwater Robot Propeller
Shiyou jixie, 2020 The thruster is the power unit of the underwater robot, and the propeller is an important part of the underwater thruster. In order to design a set of high-performance propellers, the theoretical design of the magnetically coupled propellers was first ...
Hu Qing +3 more
doaj
Dirichlet space of multiply connected domains with Weil-Petersson class boundaries [PDF]
, 2014 The restricted class of quasicircles sometimes called the "Weil-Petersson-class" has been a subject of interest in the last decade. In this paper we establish a Sokhotski-Plemelj jump formula for WP-class quasicircles, for boundary data in a certain ...
Radnell, David +2 more
core
Determining Distributions of Security Means for WSNs Based on the Model of a Neighborhood Watch
IEEE AccessNeighbourhood watch is a concept allowing a community to distribute a complex security task in between all members. Members carry out security tasks in a distributed and cooperative manner ensuring their mutual security and reducing the individual ...
Benjamin Forster +2 more
doaj +1 more source