Results 1 to 10 of about 190,829 (309)

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, Tarik Nahhal, Moez Krichen, Abdeltif El byed, Ismail Assayad   +4 more
doaj   +2 more sources

Chromatic partitions of a graph

Discrete Mathematics, 1989
AbstractLet χ(G) be the chromatic number of a graph G=(V,E), and k⩾1 be an integer. The general chromatic number χk(G) of G is the minimum order of a partition P of V such that each set in P induces a subgraph H with χ(H)⩽k. This paper initiates a study of χk(G) and generalizes various known results on χ(G).
E. Sampathkumar, C.V. Venkatachalam
openalex   +3 more sources

A social network graph partitioning algorithm based on double deep Q-Network [PDF]

Scientific Reports
With 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, Haoxiang Wang, Jingru Jiao, Kekun Hu, Ping Qi   +4 more
doaj   +2 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, Zhe Zheng, Shereef Elmetwaly, Tamar Schlick   +3 more
doaj   +2 more sources

Extremal Optimization for Graph Partitioning [PDF]

, 2001
Extremal optimization is a new general-purpose method for approximating solutions to hard optimization problems. We study the method in detail by way of the NP-hard graph partitioning problem.
A. K. Hartmann, A. Möbius, Allon G. Percus, B. A. Hendrickson, B. Bollobas, C. J. Alpert, D. R. Chialvo, D. S. Johnson, D. S. Johnson, E. Tuzel, G. Ausiello, G. S. Grest, G. Toulouse, H. Frauenkron, I. Balberg, J. Holland, J. R. Banavar, K. F. Pal, K. Y. M. Wong, K. Y. M. Wong, M. Mezard, M. Mezard, M. Paczuski, M. Palassini, M. R. Garey, P. Bak, P. Bak, P. Cheeseman, P. Erdös, R. Monasson, R. Monasson, R. Monasson, S. Boettcher, S. Boettcher, S. Boettcher, S. Boettcher, S. Boettcher, S. Boettcher, S. Boettcher, S. J. Gould, S. Kirkpatrick, S. Kirkpatrick, Stefan Boettcher, T. Klotz, Y. T. Fu   +44 more
core   +2 more sources

Polynomial Observables in the Graph Partitioning Problem [PDF]

, 2001
Although NP-Complete problems are the most difficult decisional problems, it is possible to discover in them polynomial (or easy) observables. We study the Graph Partitioning Problem showing that it is possible to recognize in it two correlated ...
Marchisio, M. A.
core   +3 more sources

Sigma Partitioning: Complexity and Random Graphs [PDF]

Discrete Mathematics & Theoretical Computer Science, 2018
A $\textit{sigma partitioning}$ of a graph $G$ is a partition of the vertices into sets $P_1, \ldots, P_k$ such that for every two adjacent vertices $u$ and $v$ there is an index $i$ such that $u$ and $v$ have different numbers of neighbors in $P_i$. The
Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi   +2 more
doaj   +3 more sources

Spectral partitions on infinite graphs [PDF]

Journal of Physics A: Mathematical and General, 2000
8 pages, to appear on Journal of Physics ...
Raffaella Burioni, Davide Cassi, C. Destri   +2 more
openalex   +4 more sources

A scalable distributed pipeline for reference-free variants calling [PDF]

BMC Genomics
Background Precision medicine pipelines typically begin with variant calling to identify disease-related mutations for optimal treatment selection. Reference-free approaches assess variations in the genetic profiles of distinct individuals through the ...
Lorenzo Di Rocco, Umberto Ferraro Petrillo   +1 more
doaj   +2 more sources

Graph Computing Systems and Partitioning Techniques: A Survey

IEEE Access, 2022
Graphs are a tremendously suitable data representations that model the relationships of entities in many application domains, such as recommendation systems, machine learning, computational biology, social network analysis, and other application domains.
Tewodros Alemu Ayall, Huawen Liu, Changjun Zhou, Abegaz Mohammed Seid, Fantahun Bogale Gereme, Hayla Nahom Abishu, Yasin Habtamu Yacob   +6 more
doaj   +1 more source