Results 241 to 250 of about 27,973 (272)
The Evolution of Data-Driven Management Zone Delineation: A Systematic Review. [PDF]
Sensors (Basel)Heidari R, Khanmohammadi R, Samavati FF.
europepmc +1 more source
Radar UAV/Bird Trajectory Feature Classification Based on TCN-Transformer and the PC-TimeGAN Data Augmentation Framework. [PDF]
Sensors (Basel)Tong F +5 more
europepmc +1 more source
Random Neural Networks for Rough Volatility. [PDF]
Appl Math OptimJacquier A, Žurič Ž.
europepmc +1 more source
On the k-partition dimension of graphs [PDF]
Theoretical Computer Science, 2020 19 pages, 3 ...
Alejandro Estrada-Moreno
exaly +6 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
The local partition dimension of graphs
Discrete Mathematics, Algorithms and Applications, 2020All graphs in this paper are undirected and connected graphs. An ordered k-partition set [Formula: see text] where [Formula: see text], the representation of a vertex [Formula: see text] of [Formula: see text] with respect to [Formula: see text] is [Formula: see text] where [Formula: see text] is the distance between the vertex v and the set [Formula:
Ridho Alfarisi +2 more
openaire +2 more sources
Bounds on the Partition Dimension of Convex Polytopes
Combinatorial Chemistry & High Throughput Screening, 2022Aims and Objective: The idea of partition and resolving sets plays an important role in various areas of engineering, chemistry and computer science such as robot navigation, facility location, pharmaceutical chemistry, combinatorial optimization, networking, and mastermind game.
Jia-Bao, Liu +2 more
openaire +2 more sources
On fault-tolerant partition dimension of graphs
Journal of Intelligent & Fuzzy Systems, 2021Fault-tolerant resolving partition is natural extension of resolving partitions which have many applications in different areas of computer sciences for example sensor networking, intelligent systems, optimization and robot navigation. For a nontrivial connected graph G (V (G) , E (G)), the partition representation of vertex v with respect to an ...
Kamran Azhar +3 more
openaire +1 more source
The partition dimension of a graph
Aequationes Mathematicae, 2000An ordered partition of the vertices of a graph \(G\) is resolving if all vertices have distinct vectors of distances to the partition classes. The partition dimension pd\((G)\) of \(G\) is the smallest size of a resolving partition. This turns out to be at most 1 more than the metric dimension, obtained similarly, after substituting partitions by ...
Chartrand, Gary +2 more
exaly +2 more sources