Results 11 to 20 of about 35,638 (292)
Deep Multilevel Graph Partitioning
29th Annual European Symposium on Algorithms (ESA 2021), 2021 Partitioning a graph into blocks of "roughly equal" weight while cutting only few edges is a fundamental problem in computer science with a wide range of applications. In particular, the problem is a building block in applications that require parallel processing. While the amount of available cores in parallel architectures has significantly increased
Gottesbüren, Lars +4 more
openaire +6 more sources
Minimum Partition of an r−Independence System
Journal of Mathematics, 2021 Graph partitioning has been studied in the discipline between computer science and applied mathematics. It is a technique to distribute the whole graph data as a disjoint subset to a different device.
Zill-e-Shams +3 more
doaj +1 more source
JTAM (Jurnal Teori dan Aplikasi Matematika), 2023 Partition dimension was introduced as a part of interesting topic in graph theory. It was focus to observe about distance. The local partition dimension is an expansion of the partition dimension by adding certain conditions to the representation of the ...
Ilham Saifudin +2 more
doaj +1 more source
Artificial Intelligence Knowledge Graph for Dynamic Networks: An Incremental Partition Algorithm
IEEE Access, 2020 The quick and intelligent requests and answers in artificial intelligence (AI) are inseparable from intelligent data. Knowledge graph makes data more intelligent by establishing association among data, which provides convenience for intelligent search ...
Yonglin Leng, Hongmin Wang, Fuyu Lu
doaj +1 more source
On the Isometric Path Partition Problem
Discussiones Mathematicae Graph Theory, 2021 The isometric path cover (partition) problem of a graph consists of finding a minimum set of isometric paths which cover (partition) the vertex set of the graph.
Manuel Paul
doaj +1 more source
The partition dimension of a subdivision of a homogeneous firecracker
Electronic Journal of Graph Theory and Applications, 2020 Finding the partition dimension of a graph is one of the interesting (and uncompletely solved) problems of graph theory. For instance, the values of the partition dimensions for most kind of trees are still unknown. Although for several classes of trees
Amrullah Amrullah
doaj +1 more source
On Partition Dimension of Generalized Convex Polytopes
Journal of Mathematics, 2023 Let G be a graph having no loop or multiple edges, k−order vertex partition for G is represented by γ=γ1,γ2,…,γk. The vector rϕγ=dϕ,γ1,dϕ,γ2,dϕ,γ3⋯,dϕ,γk is the representation of vertex ϕ with respect to γ.
Syed Waqas Shah +5 more
doaj +1 more source
A new multi-level algorithm for balanced partition problem on large scale directed graphs
Advances in Aerodynamics, 2021 Graph partition is a classical combinatorial optimization and graph theory problem, and it has a lot of applications, such as scientific computing, VLSI design and clustering etc.
Xianyue Li +4 more
doaj +1 more source
Buffered Streaming Graph Partitioning
ACM Journal of Experimental Algorithmics, 2022 Partitioning graphs into blocks of roughly equal size is a widely used tool when processing large graphs. Currently, there is a gap observed in the space of available partitioning algorithms. On the one hand, there are streaming algorithms that have been adopted to partition massive graph data on small machines.
Marcelo Fonseca Faraj, Christian Schulz
openaire +3 more sources
On The Partition Dimension of Disconnected Graphs
Journal of Mathematical and Fundamental Sciences, 2017 For a graph G=(V,E), a partition Ω=\{O_1,O_2,…,O_k \} of the vertex set V is called a resolving partition if every pair of vertices u,v∈V(G) have distinct representations under Ω.
Debi Oktia Haryeni +2 more
doaj +1 more source