Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs [PDF]
We revisit a classical graph-theoretic problem, the single-source shortest-path (SSSP) problem, in weighted unit-disk graphs. We first propose an exact (and deterministic) algorithm which solves the problem in O(nlog2n)\documentclass[12pt]{minimal ...
Haitao Wang, J. Xue
semanticscholar +1 more source
The innermost astronomical units of protoplanetary disks [PDF]
SPIE Astronomical Telescopes + Instrumentation 2016 in Edinburgh, Scotland, 8 pages, 2 ...
J. Kluska, R. García López, M. Benisty
openalex +3 more sources
Geometric process solving a class of analytic functions using q-convolution differential operator
In current realization, our object is to use the convolution product in terms of the notion quantum calculus to deliver a propagated q-derivative factor taking a more generalized Sàlàgean formula. By joining both the new factor together with the Janowski
Rabha W. Ibrahim
doaj +1 more source
Liar's domination in unit disk graphs [PDF]
In this article, we study a variant of the minimum dominating set problem known as the minimum liar's dominating set (MLDS) problem. We prove that the MLDS problem is NP-hard in unit disk graphs. Next, we show that the recent sub-quadratic time $\frac{11}{2}$-factor approximation algorithm \cite{bhore} for the MLDS problem is erroneous and propose a ...
Ramesh K. Jallu +2 more
openaire +3 more sources
On Riesz type inequalities for harmonic mappings on the unit disk [PDF]
We prove some sharp inequalities for complex harmonic functions on the unit disk. The results extend a M. Riesz conjugate function theorem and some well-known estimates for holomorphic functions.
D. Kalaj
semanticscholar +1 more source
Analytic Study of Complex Fractional Tsallis’ Entropy with Applications in CNNs
In this paper, we study Tsallis’ fractional entropy (TFE) in a complex domain by applying the definition of the complex probability functions. We study the upper and lower bounds of TFE based on some special functions.
Rabha W. Ibrahim, Maslina Darus
doaj +1 more source
QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs [PDF]
A (unit) disk graph is the intersection graph of closed (unit) disks in the plane. Almost three decades ago, an elegant polynomial-time algorithm was found for Maximum Clique on unit disk graphs [Clark, Colbourn, Johnson; Discrete Mathematics '90]. Since
Bonnet, E. +4 more
core +6 more sources
On higher derivatives of multivalent analytic functions with negative coefficients associated with (𝑟, 𝑞) - Calculus [PDF]
In this paper, we review established concepts and fundamental results of (𝑟, 𝑞) Calculus. Throughout this paper, let 𝑟, 𝑞 be constants with 0 < 𝑞 < 𝑟 ≤ 1.
Noora Kamil, Kassim Jassim
doaj +1 more source
Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs [PDF]
We give algorithms with running time 2O(klogk)·nO(1)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength ...
F. Fomin +4 more
semanticscholar +1 more source
Composition-Differentiation Operator on the Bergman Space
We investigate the properties of composition-differentiation operator Dψ on the Bergman space of the unit disk L2a(D). Specifically, we characterize the properties of the reproducing kernel for the derivatives of the Bergman space functions. Moreover, we
K. O. Aloo, J. O. Bonyo, I. Okello
doaj +1 more source

