Results 11 to 20 of about 36,530 (307)
Genetic algorithms for graph partitioning and incremental graph partitioning [PDF]
Proceedings of Supercomputing '94, 1994 Partitioning graphs into equally large groups of nodes, minimizing the number of edges between different groups, is an extremely important problem in parallel computing. This paper presents genetic algorithms for suboptimal graph partitioning, with new crossover operators (KNUX, DKNUX) that lead to orders of magnitude improvement over traditional ...
Maini, Harpal +3 more
openaire +4 more sources
Graph partitioning: an updated survey [PDF]
AKCE International Journal of Graphs and Combinatorics, 2023 Graph partitioning problem, which is one of the most important topics in graph theory, usually asks for a partition of the vertex set of a graph into pairwise disjoint subsets with various requirements. It comes from the well-known Max-Cut Problem: Given
Shufei Wu, Jianfeng Hou
doaj +2 more sources
Entropy, 2023 We study partitions (equitable, externally equitable, or other) of graphs that describe physico-chemical systems at the atomic or molecular level; provide examples that show how these partitions are intimately related with symmetries of the systems; and discuss how such a link can further lead to insightful relations with the systems’ physical and ...
Ioannis Michos, Vasilios Raptis
openaire +3 more sources
Standard Framework for Comparison of Graph Partitioning Techniques
JISR on Computing, 2015 Graph Partitioning is used to distribute graph partitions across nodes for processing. It is very important in the pre-processing step for distributed graph processing.
Mudasser Iqbal, Saif-ur-Rahman
doaj +1 more source
Adaptive Partitioning for Large-Scale Dynamic Graphs [PDF]
, 2013 —In the last years, large-scale graph processing has gained increasing attention, with most recent systems placing particular emphasis on latency. One possible technique to improve runtime performance in a distributed graph processing system is to reduce
Martella, Claudio +13 more
core +1 more source
Partitions of Graphs into Cographs
Electronic Notes in Discrete Mathematics, 2002 A cograph is a graph that can be constructed by a single vertex using complementation and disjoint union operations. Equivalently, cographs are exactly those graphs which do not contain an induced path \(P_4\) with four vertices and three edges. The \(c\)-chromatic number \(c(G)\) of a graph \(G\) is the minimum number \(k\) such that the vertex set of
John Gimbel, Jaroslav Nesetril
openaire +2 more sources
Partitions in Matrices and Graphs
European Journal of Combinatorics, 1991 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Daniel R. Hughes, Navin M. Singhi
openaire +1 more source
GAP: Genetic Algorithm Based Large-Scale Graph Partition in Heterogeneous Cluster
IEEE Access, 2020 Graph is an important model to describe various networks, and its scale becomes larger and larger with the development of communication and information technology.
Menghan Li +3 more
doaj +1 more source
An effective data placement strategy for XML documents [PDF]
, 2001 As XML is increasingly being used in Web applications, new technologies need to be investigated for processing XML documents with high performance. Parallelism is a promising solution for structured document processing and data placement is a major ...
Lü, K, Yuanling Zhu, Kevin Lü, Zhu, Y
core +1 more source
Boosting graph computation with generic methods: partitioning and incrementalization [PDF]
, 2021 In this thesis we develop a package of generic methods for boosting the velocity of graph computations, regarding partitioning and incrementalization. The former is to deal with the challenges of volume and velocity over big data, and make computations
Xu, Ruiqi
core +1 more source