Results 41 to 50 of about 2,245,805 (347)
Low Diameter Graph Decompositions by Approximate Distance Computation [PDF]
, 2019 In many models for large-scale computation, decomposition of the problem is key to efficient algorithms. For distance-related graph problems, it is often crucial that such a decomposition results in clusters of small diameter, while the probability that ...
Becker, Ruben +2 more
core +2 more sources
Automorphic Decompositions of Graphs
Graphs and Combinatorics, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Beeler, Robert A., Jamison, Robert E.
openaire +3 more sources
Connectivity and tree structure in finite graphs [PDF]
, 2013 Considering systems of separations in a graph that separate every pair of a given set of vertex sets that are themselves not separated by these separations, we determine conditions under which such a separation system contains a nested subsystem that ...
B A Reed +15 more
core +3 more sources
Claw-decomposition of Kneser graphs
Transactions on Combinatorics, 2022 Summary: A claw is a star with three edges. The Kneser graph \(KG_{n, 2}\) is the graph whose vertices are the 2-subsets of an \(n\)-set, in which two vertices are adjacent if and only if their intersection is empty. In this paper, we prove that \(KG_{n, 2}\) is claw-decomposable, for all \(n\geq 6\).
C, Sankari, R, Sangeetha, Arthi, K.
openaire +3 more sources
Decomposition of complete graphs into connected unicyclic graphs with eight edges and pentagon
Indonesian Journal of Combinatorics, 2019 A G-decomposition of the complete graph Kn is a family of pairwise edge disjoint subgraphs of Kn, all isomorphic to G, such that every edge of Kn belongs to exactly one copy of G.
Dalibor Froncek, O'Neill Kingston
doaj +1 more source
Fast Spectral Approximation of Structured Graphs with Applications to Graph Filtering
Algorithms, 2020 To analyze and synthesize signals on networks or graphs, Fourier theory has been extended to irregular domains, leading to a so-called graph Fourier transform.
Mario Coutino +3 more
doaj +1 more source
The approximate Loebl-Koml\'os-S\'os Conjecture II: The rough structure of LKS graphs [PDF]
, 2016 This is the second of a series of four papers in which we prove the following relaxation of the Loebl-Komlos--Sos Conjecture: For every $\alpha>0$ there exists a number $k_0$ such that for every $k>k_0$ every $n$-vertex graph $G$ with at least $(\frac12+\
Hladký, Jan +5 more
core +3 more sources
Decomposition of hypercube graphs into paths and cycles of length four
AKCE International Journal of Graphs and Combinatorics, 2022 By a [Formula: see text]-decomposition of a graph G, we mean a partition of the edge set of G into p paths of length 4 and q cycles of length 4. In this paper, we give conditions for a [Formula: see text]-decomposition of the n-dimensional hypercube ...
D. Saranya, S. Jeevadoss
doaj +1 more source
Image Clustering Algorithm Based on Hypergraph Regularized Nonnegative Tucker Decomposition [PDF]
Jisuanji gongcheng, 2022 The internal geometry structure of high-dimensional data is ignored when nonnegative tensor decomposition is applied to image clustering.To solve this problem, we propose a Hypergraph regularized Nonnegative Tucker Decomposition(HGNTD) model by adding a ...
CHEN Luyao, LIU Qilong, XU Yunxia, CHEN Zhen
doaj +1 more source
Discrete Mathematics, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Caro, Yair, Yuster, Raphael
openaire +2 more sources