Results 271 to 280 of about 206,716 (316)
Identifying batch-integrated domains from spatial transcriptomics via graph autoencoder with contrastive learning based on cross-modality and data augmentation. [PDF]
Brief BioinformMao Y +10 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
The Journal of Supercomputing, 2021
Recently more and more information sources are connected together and become a sort of complex graphs that can be exploited not only as a structured and semi-structured data such as rdb or xml, RDF or NoSQL, but also as many kinds of unstructured data such as web, bioinformatics, genometrics, patents, social media, knowlege graphs, IoT, hidden graph ...
Wookey Lee +4 more
openaire +1 more source
Recently more and more information sources are connected together and become a sort of complex graphs that can be exploited not only as a structured and semi-structured data such as rdb or xml, RDF or NoSQL, but also as many kinds of unstructured data such as web, bioinformatics, genometrics, patents, social media, knowlege graphs, IoT, hidden graph ...
Wookey Lee +4 more
openaire +1 more source
Incrementalizing Graph Algorithms
Proceedings of the 2021 International Conference on Management of Data, 2021Incremental algorithms are important to dynamic graph analyses, but are hard to write and analyze. Few incremental graph algorithms are in place, and even fewer offer performance guarantees. This paper approaches this by proposing to incrementalize existing batch algorithms.
Wenfei Fan +5 more
openaire +1 more source
ACM Computing Surveys, 1984
This is an extensive survey of parallel algorithms used to solve graph problems. In the first part some models of parallel computation are shortly described and discussed. They include: systolic arrays, associative processors, various models of array processors (also known as SIMD machines) and multiple CPU computers.
Michael J. Quinn, Narsingh Deo
openaire +2 more sources
This is an extensive survey of parallel algorithms used to solve graph problems. In the first part some models of parallel computation are shortly described and discussed. They include: systolic arrays, associative processors, various models of array processors (also known as SIMD machines) and multiple CPU computers.
Michael J. Quinn, Narsingh Deo
openaire +2 more sources
An algorithmic study of switch graphs
Acta Informatica, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bastian Katz +2 more
openaire +3 more sources
An algorithm for a special graph
Proceedings of the 35th Annual Southeast Regional Conference on - ACM-SE 35, 1997Most of practical problems which call for graph theory involve large graphs - graphs that are virtually impossible for hand computation. In fact, one of the reasons for the recent growth of interest in graph theory has been the arrival of the high-speed electronic computer.
openaire +1 more source
2008
The aim of this paper is to survey the results on dynamic algebraic algorithms, with main interest in matrix functions such as, determinant, inverse, rank and characteristic polynomial. First of all we summary the papers that in dynamic setup these problems can be solved faster than evaluating everything from scratch.
openaire +1 more source
The aim of this paper is to survey the results on dynamic algebraic algorithms, with main interest in matrix functions such as, determinant, inverse, rank and characteristic polynomial. First of all we summary the papers that in dynamic setup these problems can be solved faster than evaluating everything from scratch.
openaire +1 more source
On an Algorithm for Ordering of Graphs
Canadian Mathematical Bulletin, 1971Let (G, ρ) be a finite connected (undirected) graph without loops and multiple edges. So x, y being two elements of G (vertices of the graph (G, ρ)), 〈x, y〉 ∊ ρ means that x and y are connected by an edge. Two vertices x, y ∊ G have the distance μ(x, y) equal to n, if n is the smallest number with the following property: there exists a sequence x0, x1,
openaire +2 more sources
Algorithms for Square Roots of Graphs
SIAM Journal on Discrete Mathematics, 1995The \(k\)th power of a graph \(G\) is the graph \(G^ k\) in which all pairs of distinct vertices at distance at most \(k\) in \(G\) are adjacent in \(G^ k\). A \(k\)th root \(G^{1/k}\) of \(G\) is a graph for which \((G^{1/k})^ k\cong G\). A graph \(H\) is a \(k\)th power if there exists some graph \(G\) for which \(H\cong G^ k\).
Yaw-Ling Lin, Steven Skiena
openaire +2 more sources
Towards Graph Programs for Graph Algorithms
2004Graph programs as introduced by Habel and Plump [8] provide a simple yet computationally complete language for computing functions and relations on graphs. We extend this language such that numerical computations on labels can be conveniently expressed. Rather than resorting to some kind of attributed graph transformation, we introduce conditional rule
Detlef Plump, Sandra Steinert
openaire +1 more source