Results 21 to 30 of about 190,829 (309)
Partitions of Graphs into Cographs
Electronic Notes in Discrete Mathematics, 2002 AbstractCographs form the minimal family of graphs containing K1 that is closed with respect to complementation and disjoint union. We discuss vertex partitions of graphs into the smallest number of cographs. We introduce a new parameter, calling the minimum order of such a partition the c-chromatic number of the graph. We begin by axiomatizing several
Jaroslav Nesetril, John Gimbel
openaire +3 more sources
Partitions in Matrices and Graphs
European Journal of Combinatorics, 1991 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
D. R. Hughes, N. M. Singhi
openaire +2 more sources
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
Cuadrado, F +4 more
core +2 more sources
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
Generalized partitions of graphs
Discrete Applied Mathematics, 1999 The authors introduce a general graph partitioning problem: Let \(C\) be a class of graphs and \(H\) a fixed graph with vertex class \(V(H)=\{1,2,\dots,n\}\). An (resp. ONTO) \((H,C)\)-partition of a graph \(G\) is a partition \(V_1,V_2,\dots,V_n\) of \(V(G)\) such that, for each \(i\), the subgraph of \(G\) induced by \(V_i\) belongs to \(C\) and, if \
Gary MacGillivray, Min-Li Yu
openaire +2 more sources
Discrete Mathematics, 1996 A graph \(G\) admits a tree-partition of width \(k\) if its vertex set can be partitioned into sets of size at most \(k\) so that the graph obtained by identifying the vertices in each set of the partition, and then deleting loops and parallel edges, is a forest. If no such \(k\) exist, the width is set to be infinite.
Bogdan Oporowski, Guoli Ding
openaire +3 more sources
Revisiting the Isoperimetric Graph Partitioning Problem
IEEE Access, 2019 Isoperimetric graph partitioning, which is also known as the Cheeger cut, is NP-hard in its original form. In the literature, multiple modifications to this problem have been proposed to obtain approximation algorithms for clustering applications. In the
Sravan Danda +3 more
doaj +1 more source
A Novel Partitioning Method for Accelerating the Block Cimmino Algorithm [PDF]
, 2018 We propose a novel block-row partitioning method in order to improve the convergence rate of the block Cimmino algorithm for solving general sparse linear systems of equations.
Aykanat, Cevdet +2 more
core +2 more sources
Partitioning the edges of a graph
Journal of Combinatorial Theory, Series B, 1978 AbstractFor any integer m (≥2), it is known that there are simple graphs of maximum valence m whose edges cannot be coloured with m colours in such a way that adjacent edges shall have different colours. We find those values of m and k for which it is true that every simple graph whose maximum valence does not exceed mk can be coloured with m colours ...
Anthony J. W. Hilton, Rhys Price Jones
openaire +3 more sources
RBSEP: a reassignment and buffer based streaming edge partitioning approach
Journal of Big Data, 2019 In recent years, the rapid growth of the Internet has led to creation of massively large graphs. Since databases have become very large nowadays, they cannot be processed by a simple machine at an acceptable time anymore; therefore, traditional graph ...
Monireh Taimouri, Hamid Saadatfar
doaj +1 more source