Results 1 to 10 of about 2,192,848 (347)
Graph Decompositions and Factorizing Permutations [PDF]
Discrete Mathematics & Theoretical Computer Science, 2002 A factorizing permutation of a given graph is simply a permutation of the vertices in which all decomposition sets appear to be factors. Such a concept seems to play a central role in recent papers dealing with graph decomposition. It is applied here
Christian Capelle +2 more
doaj +9 more sources
Accurate assembly of transcripts through phase-preserving graph decomposition. [PDF]
Nat Biotechnol, 2017 We introduce Scallop, an accurate reference-based transcript assembler that improves reconstruction of multi-exon and lowly expressed transcripts. Scallop preserves long-range phasing paths extracted from reads, while producing a parsimonious set of ...
Shao M, Kingsford C.
europepmc +2 more sources
Shared-memory Graph Truss Decomposition [PDF]
International Conference on High Performance Computing, 2017 We present PKT, a new shared-memory parallel algorithm and OpenMP implementation for the truss decomposition of large sparse graphs. A k-truss is a dense subgraph definition that can be considered a relaxation of a clique. Truss decomposition refers to a
Kabir, Humayun, Madduri, Kamesh
core +2 more sources
On the decomposition threshold of a given graph [PDF]
J. Comb. Theory B, 2019 We study the $F$-decomposition threshold $\delta_F$ for a given graph $F$. Here an $F$-decomposition of a graph $G$ is a collection of edge-disjoint copies of $F$ in $G$ which together cover every edge of $G$. (Such an $F$-decomposition can only exist if
Glock, Stefan +4 more
core +4 more sources
Toeplitz graph decomposition [PDF]
Transactions on Combinatorics, 2012 Let $n,t_1,...,t_k$ be distinct positive integers. A Toeplitz graph $G=(V, E)$ denoted by $T_n$ is a graph, where $V ={1,...,n}$ and $E= {(i,j) : |i-j| in {t_1,...,t_k}}$.In this paper, we present some results on decomposition of Toeplitz graphs.
Samira Hossein Ghorban
doaj +2 more sources
Graph decomposition techniques for solving combinatorial optimization problems with variational quantum algorithms [PDF]
Quantum Information Processing, 2023 The quantum approximate optimization algorithm (QAOA) has the potential to approximately solve complex combinatorial optimization problems in polynomial time. However, current noisy quantum devices cannot solve large problems due to hardware constraints.
Moises Ponce +6 more
semanticscholar +1 more source
Temporal Graph Signal Decomposition [PDF]
Knowledge Discovery and Data Mining, 2021 Temporal graph signals are multivariate time series with individual components associated with nodes of a fixed graph structure. Data of this kind arises in many domains including activity of social network users, sensor network readings over time, and ...
M. McNeil, Lin Zhang, Petko Bogdanov
semanticscholar +1 more source
Knowledge Graph Reasoning Based on Tensor Decomposition and MHRP-Learning
Advances in Multimedia, 2021 In the process of learning and reasoning knowledge graph, the existing tensor decomposition technology only considers the direct relationship between entities in knowledge graph. However, it ignores the characteristics of the graph structure of knowledge
Tangsen Huang +3 more
doaj +1 more source
Eulerian Cycle Decomposition Conjecture for the line graph of complete graphs
AKCE International Journal of Graphs and Combinatorics, 2019 The Eulerian Cycle Decomposition Conjecture, by Chartrand, Jordon and Zhang, states that if the minimum number of odd cycles in a cycle decomposition of an Eulerian graph G of size m is a, the maximum number of odd cycles in such a cycle decomposition is
R. Rajarajachozhan, R. Sampathkumar
doaj +2 more sources
LightGCL: Simple Yet Effective Graph Contrastive Learning for Recommendation [PDF]
International Conference on Learning Representations, 2023 Graph neural network (GNN) is a powerful learning approach for graph-based recommender systems. Recently, GNNs integrated with contrastive learning have shown superior performance in recommendation with their data augmentation schemes, aiming at dealing ...
Xuheng Cai +3 more
semanticscholar +1 more source