Survey of intersection graphs, fuzzy graphs and neutrosophic graphs

T Fujita - … and Uncertainization: Fuzzy, Neutrosophic, Soft, Rough …, 2024 - books.google.com
Graph theory is afundamental branch of mathematicsthat studiesnetworksconsisting of
nodes (vertices) and their connections (edges). Extensive research has been conducted on …

Identification of shared proteins between ankylosing spondylitis and its comorbidities through network biology

AU Bello, S Harun, NA Aleng, R Sakthiswary… - … Modeling Analysis in …, 2024 - Springer
The causes of ankylosing spondylitis (AS) and the pathobiological mechanisms associating
it with its comorbidities remain challenging to identify. This study uses network biology to …

Reverse shortest path problem in weighted unit-disk graphs

H Wang, Y Zhao - … Conference and Workshops on Algorithms and …, 2022 - Springer
Given a set P of n points in the plane, a unit-disk graph G r (P) with respect to a parameter r
is an undirected graph whose vertex set is P such that an edge connects two points p, q∈ P …

Reverse shortest path problem for unit-disk graphs

H Wang, Y Zhao - Algorithms and Data Structures: 17th International …, 2021 - Springer
Given a set P of n points in the plane, a unit-disk graph G_ r (P) G r (P) with respect to a
radius r is an undirected graph whose vertex set is P such that an edge connects two points …

An algorithmic framework for the single source shortest path problem with applications to disk graphs

K Klost - Computational Geometry, 2023 - Elsevier
Shortest path problems are among the fundamental problems in graph theory. It is folklore
that the unweighted single source shortest path (SSSP) problem in general graphs can be …

Computing the minimum bottleneck moving spanning tree

H Wang, Y Zhao - arXiv preprint arXiv:2206.12500, 2022 - arxiv.org
Given a set $ P $ of $ n $ points that are moving in the plane, we consider the problem of
computing a spanning tree for these moving points that does not change its combinatorial …

Dynamic Unit-Disk Range Reporting

H Wang, Y Zhao - arXiv preprint arXiv:2501.00120, 2024 - arxiv.org
For a set $ P $ of $ n $ points in the plane and a value $ r> 0$, the unit-disk range reporting
problem is to construct a data structure so that given any query disk of radius $ r $, all points …

Reverse shortest path problem for unit-disk graphs

H Wang, Y Zhao - Journal of Computational Geometry, 2023 - jocg.org
Given a set P of n points in the plane, the unit-disk graph G r (P) with respect to a parameter r
is an undirected graph whose vertex set is P such that an edge connects two points p, q\in P …

Algorithms for Unit-Disk Graphs and Related Problems

Y Zhao - 2023 - digitalcommons.usu.edu
In this dissertation, we study algorithms for several problems on unit-disk graphs and related
problems. The unit-disk graph can be viewed as an intersection graph of a set of congruent …

[PDF][PDF] Unit disk graphs in Fuzzy and Neutrosophic Graphs

T Fujita - researchgate.net
This paper investigates unit disk graphs within the frameworks of fuzzy and neutrosophic
graphs, expanding upon the traditional study of intersection graphs. Unit disk graphs are …