Results 1 to 10 of about 2,245,805 (347)
Monochromatic Clique Decompositions of Graphs [PDF]
Journal of Graph Theory, 2014 Let $G$ be a graph whose edges are coloured with $k$ colours, and $\mathcal H=(H_1,\dots , H_k)$ be a $k$-tuple of graphs. A monochromatic $\mathcal H$-decomposition of $G$ is a partition of the edge set of $G$ such that each part is either a single edge
Győri E. +6 more
core +9 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 +3 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 ...
Mingfu Shao, Carl Kingsford
semanticscholar +2 more sources
Density-Friendly Graph Decomposition [PDF]
ACM Transactions on Knowledge Discovery from Data, 2019 Decomposing a graph into a hierarchical structure via k-core analysis is a standard operation in any modern graph-mining toolkit. k-core decomposition is a simple and efficient method that allows to analyze a graph beyond its mere degree distribution ...
Nikolaj Tatti
semanticscholar +5 more sources
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 +6 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
PLoS Comput. Biol., 2018 Recently, a growing number of biological research and scientific experiments have demonstrated that microRNA (miRNA) affects the development of human complex diseases.
Xing Chen, Jun Yin, Jia Qu, Li Huang
semanticscholar +3 more sources
Decompositions of Cubic Traceable Graphs
Discussiones Mathematicae Graph Theory, 2020 A traceable graph is a graph with a Hamilton path. The 3-Decomposition Conjecture states that every connected cubic graph can be decomposed into a spanning tree, a 2-regular graph and a matching. We prove the conjecture for cubic traceable graphs.
Liu Wenzhong, Li Panpan
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