Results 51 to 60 of about 89,804 (156)

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, Castillo H. E., Comtet A., Frisch U., Hughes B. D.   +4 more
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

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

ACapDS: An Energy-Efficient and Fault-Tolerant Distributed Capacitated Dominating Set Algorithm for Industrial IoT

IEEE Access
Design and analysis of energy-efficient and fault-tolerant dominating set (DS) algorithms are vital tasks for Industrial Internet of Things (IIoT) scenarios, as operational efficiency is a key objective in most industries.
Ozkan Arapoglu, Umut Can Cabuk, Orhan Dagdeviren, Moharram Challenger   +3 more
doaj   +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., Kobourov, S. G., Pupyrev, S., Toeniskoetter, J.   +3 more
openaire   +2 more sources

Solving optimization problems with local light-shift encoding on Rydberg quantum annealers

Physical Review Research
We 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, Rick Mukherjee, Herwig Ott, Peter Schmelcher   +3 more
doaj   +1 more source

Calculation Methodology and Results of Optimization of Design Parameters of the Tractor Recuperative Mounted System When Aggregated with Forest Tillage Implements

Лесной журнал
The article considers the disadvantages of modern forest tillage implements. Promising areas of research conducted by Russian and foreign scientists are presented, which make it possible to increase the efficiency of tractors aggregated with mounted ...
Valeryi I. Posmetyev, Maksim A. Savinkov, Viktor V. Posmetyev, Andrey Yu. Manukovskii, Vadim O. Nikonov   +4 more
doaj   +1 more source

Near Optimal Broadcast with Network Coding in Large Sensor Networks [PDF]

, 2007
We study efficient broadcasting for wireless sensor networks, with network coding. We address this issue for homogeneous sensor networks in the plane. Our results are based on a simple principle (IREN/IRON), which sets the same rate on most of the nodes (
Adjih, Cédric, Cho, Song Yean, Jacquet, Philippe   +2 more
core   +2 more sources

On Embeddability of Unit Disk Graphs onto Straight Lines [PDF]

Theory of Computing Systems, 2020
Comment: 20 pages, accepted to CSR ...
openaire   +2 more sources

Hamiltonian cycles in faulty random geometric networks [PDF]

, 2001
In this paper we analyze the Hamiltonian properties of faulty random networks. This consideration is of interest when considering wireless broadcast networks.
Petit Silvestre, Jordi
core   +1 more source