Resolving hop dominating sets of P3[P4]

Uniform and regular reliable broadcast protocols facilitating concurrent message dissemination for mobile ad hoc networks with the network liveness property - ScienceDirect

Multi-constraint shortest path using forest hop labeling

Quality attributes in edge computing for the Internet of Things: A systematic mapping study - ScienceDirect

Plane Hop Spanners for Unit Disk Graphs

The Minimum Principle of SINR: A Useful Discretization Tool for Wireless Communication

Efficient Reverse Skyline Processing over Sliding Windows in Wireless Sensor Networks - Jun-Ki Min, 2015

Resolving hop dominating sets of P3[P4]

Applied Sciences, Free Full-Text

Reducing communication in algebraic multigrid with multi-step node aware communication - Amanda Bienz, William D Gropp, Luke N Olson, 2020

PDF) Two upper bounds on the chromatic number

Graph P3 • P4 with γ Rh (P3 • P4) = 6

Rydberg Macrodimers: Diatomic Molecules on the Micrometer Scale

PDF) Independent dominating sets and hamiltonian cycles

The Evolving Landscape of Antibody–Drug Conjugates: In Depth Analysis of Recent Research Progress

Graph P3 • P4 with γ Rh (P3 • P4) = 6