Results 31 to 40 of about 768,033 (273)
Summary of Large-Scale Grapb Partitioning Algoritbms
Dianxin kexue, 2014 The large-scale graph partitioning algorithms were summarized and graph computing models in the distributed environment were introduced. Firstly the large-scale static graph partitioning algorithms and the dynamic graph partitioning algorithms were ...
Jinfeng Xu +4 more
doaj +2 more sources
Algorithms for partitioning logical circuits into subcircuits
Informatika, 2020 The problem of partitioning a logical circuit into subcircuits is considered. It is of great importance when performing optimization transformations in the process of circuit synthesis.
N. A. Kirienko
doaj +1 more source
Hypergraph partitioning using tensor eigenvalue decomposition.
PLoS ONE, 2023 Hypergraphs have gained increasing attention in the machine learning community lately due to their superiority over graphs in capturing super-dyadic interactions among entities.
Deepak Maurya, Balaraman Ravindran
doaj +1 more source
On the path partition of graphs
Opuscula Mathematica, 2023 Let \(G\) be a graph of order \(n\). The maximum and minimum degree of \(G\) are denoted by \(\Delta\) and \(\delta\), respectively. The path partition number \(\mu(G)\) of a graph \(G\) is the minimum number of paths needed to partition the vertices of \(G\).
Mekkia Kouider, Mohamed Zamime
openaire +2 more sources
Query-Sensitive Graph Partitioner for Pattern Matching Applications
IEEE Access, 2019 Searching and mining in large graphs is critical to a variety of applications, at the core of which is the pattern matching activity. The scalable processing of large graphs requires careful distribution of graphs across clusters.
Li Lu, Bei Hua
doaj +1 more source
Enhanced adaptive partitioning in a distributed graph database
Journal of Information and Telecommunication, 2021 Nowadays, open-source graph databases do not include an inherent mechanism for data relocation that would be based on their usage. They often do not offer even appropriate monitoring that could help to make such a decision.
Lucie Svitáková +2 more
doaj +1 more source
Parallel Heuristics for Balanced Graph Partitioning Based on Richness of Implicit Knowledge
IEEE Access, 2019 Balanced graph partitioning (BGP) has a wide range of applications that involve many large-scale distributed data processing problems. However, most of the existing approaches to parallel graph partitioning neglect the problem of the richness of implicit
Zhipeng Yang +2 more
doaj +1 more source
SIAM Journal on Discrete MathematicsGiven a finite set of points in $\mathbb{R}^d$, Tverberg's theorem guarantees the existence of partitions of this set into parts whose convex hulls intersect. We introduce a graph structured on the family of Tverberg partitions of a given set of points, whose edges describe closeness between different Tverberg partitions. We prove bounds on the minimum
Déborah Oliveros +3 more
openaire +3 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 +2 more sources
FEBS Letters, EarlyView.We present robust protocols for the preparation of supported lipid bilayers (SLBs) incorporating either Salmonella smooth LPS or outer membrane vesicles (OMVs). We use a combination of quartz crystal microbalance with dissipation (QCM‐D) and fluorescence microscopy to both characterize the SLBs of various compositions and to probe their interactions ...
Hudson P. Pace +6 more
wiley +1 more source