Results 1 to 10 of about 768,033 (273)
Some of the next articles are maybe not open access.
Algorithms for graph partitioning on the planted partition model
Random Structures and Algorithms, 1999Summary: The NP-hard graph bisection problem is to partition the nodes of an undirected graph into two equal-sized groups so as to minimize the number of edges that cross the partition. The more general graph \(\ell\)-partition problem is to partition the nodes of an undirected graph into \(\ell\) equal-size groups so as to minimize the total number of
Anne Condon, Richard M. Karp
openaire +3 more sources
Canadian Mathematical Bulletin, 1968
In 1879 Kempe [5] presented what has become the most famous of all incorrect proofs of the Four Colour Conjecture, but even though his proof was erroneous his method has become quite useful. In 1890 Heawood [4] was able to modify Kempe's method to establish the Five Colour Theorem for planar graphs.
openaire +2 more sources
In 1879 Kempe [5] presented what has become the most famous of all incorrect proofs of the Four Colour Conjecture, but even though his proof was erroneous his method has become quite useful. In 1890 Heawood [4] was able to modify Kempe's method to establish the Five Colour Theorem for planar graphs.
openaire +2 more sources
Ars Comb., 1999
Summary: For a given graph \(G\), we fix \(s\), and partition the vertex set into \(s\) classes, so that any given class contains few edges. The result gives a partition \((U_1, \dots , U_s)\), where \(e(U_i) \leq \frac {e(G)}{s^2} + 4e \sqrt {e(G)}\) for each \(1 \leq i \leq s\).
openaire +2 more sources
Summary: For a given graph \(G\), we fix \(s\), and partition the vertex set into \(s\) classes, so that any given class contains few edges. The result gives a partition \((U_1, \dots , U_s)\), where \(e(U_i) \leq \frac {e(G)}{s^2} + 4e \sqrt {e(G)}\) for each \(1 \leq i \leq s\).
openaire +2 more sources
Partitions and Their Representative Graphs
American Journal of Mathematics, 1951openaire +1 more source
A social network graph partitioning algorithm based on double deep Q-Network [PDF]
Scientific ReportsWith the rapid expansion of social networks, efficiently mining and analyzing massive graph data has become a fundamental challenge in social network research. Graph partitioning plays a pivotal role in enhancing the performance of such analyses. However,
Jie Cao +4 more
doaj +2 more sources
DHPV: a distributed algorithm for large-scale graph partitioning [PDF]
Journal of Big Data, 2020 Big graphs are part of the movement of “Not Only SQL” databases (also called NoSQL) focusing on the relationships between data, rather than the values themselves.
Wilfried Yves Hamilton Adoni +4 more
doaj +2 more sources
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
core +5 more sources
RNA graph partitioning for the discovery of RNA modularity: a novel application of graph partition algorithm to biology. [PDF]
PLoS ONE, 2014 Graph representations have been widely used to analyze and design various economic, social, military, political, and biological networks. In systems biology, networks of cells and organs are useful for understanding disease and medical treatments and, in
Namhee Kim +3 more
doaj +2 more sources
A Graph-based Benchmark dataset for Printed Circuit Netlist Partitioning [PDF]
Scientific DataAs a critical component of electronic design automation and reverse engineering, printed circuit netlist partitioning has long been a significant research topic in this field.
Jie Yang +6 more
doaj +2 more sources
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, Zhu, Y
core +7 more sources