Results 41 to 50 of about 768,033 (273)
Journal of King Saud University: Computer and Information Sciences, 2019 In a distributed environment, the volume of graph database increases quickly because graphs emerge from several autonomous sources. Sub-graph query processing is a challenging problem in distributed environment.
Shaik Fathimabi +2 more
doaj +1 more source
Modelling stem cell differentiation related processes—A practical overview for biologists
FEBS Letters, EarlyView.Stem cell differentiation is complex and difficult to control experimentally. This review introduces suitable computational modelling approaches that can support stem cell research, from mechanistic ODE and abstract models to multiscale and deep learning methods.
Ricco Zeegelaar +4 more
wiley +1 more source
Efficient Large Graph Partitioning Scheme Using Incremental Processing in GPU
IEEE AccessAs the processing of large-scale graphs on a single device is infeasible without partitioning, graph partitioning algorithms are essential for various algorithms and distributed computing tasks utilizing graph data.
Hyeonbyeong Lee +8 more
doaj +1 more source
Property Graph Partition Algorithm Based on Label Propagation and Sand Cat Swarm Optimization [PDF]
Jisuanji gongchengThe graphs are widely applied in social networks and communication networks, and the distributed graph processing systems have been used more frequently in processing and analyzing large-scale graphs with the increase of the scale of the graphs.
CUI Huanqing, WU Yifan, DONG Kezhen, ZHOU Shengqing
doaj +1 more source
A Partition of Connected Graphs
The Electronic Journal of Combinatorics, 2005 We define an algorithm $k$ which takes a connected graph $G$ on a totally ordered vertex set and returns an increasing tree $R$ (which is not necessarily a subtree of $G$). We characterize the set of graphs $G$ such that $k(G)=R$. Because this set has a simple structure (it is isomorphic to a product of non-empty power sets), it is easy to evaluate ...
openaire +3 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.
Guoli Ding, Bogdan Oporowski
openaire +3 more sources
Design and analysis strategies for robust microbiome ageing research
FEBS Letters, EarlyView.The gut microbiome changes with age and associates with age‐related morbidity and mortality, establishing it as a potential biomarker and intervention target for ageing. Realising this potential requires methodological rigour, yet distinguishing biological signals from methodological artefacts remains challenging across cohorts. This review provides an
Mark Olenik +5 more
wiley +1 more source
ViAGraph : a Tool for Graph Visualization and Analysis [PDF]
, 2006 Graphs are common representations that can capture the structure and then can model a wide range of data and knowledge. In this paper, we present and discuss the functionalities of ViAGraph a tool for graph visualization and analysis.
Truong, Quoc Dinh, Dkaki, Taoufiq
core +1 more source
Dual Clustering-Based Method for Geospatial Knowledge Graph Partitioning
Applied SciencesGeospatial knowledge graphs provide critical technology for integrating geographic information and semantic knowledge, which are very useful for geographic data analysis.
Yuxuan Chen +7 more
doaj +1 more source
Boundary Vertices Sensitive Vertex-Cut Partitioning Algorithm
JISR on Computing, 2015 Graph Partitioning is one of the favorite research topics among researchers since the 70s. It attracts a diverse group of researchers from various fields such as engineering, science and mathematics. In the last decade, the graphs have increased in size
Asad Feroz Ali, Syed Saif ur Rahman
doaj +1 more source