Results 31 to 40 of about 2,192,848 (347)
Hyperspectral Image Super-Resolution Algorithm Based on Graph Regular Tensor Ring Decomposition
Remote Sensing, 2023 This paper introduces a novel hyperspectral image super-resolution algorithm based on graph-regularized tensor ring decomposition aimed at resolving the challenges of hyperspectral image super-resolution.
Shasha Sun +5 more
doaj +1 more source
α_{2}-labeling of graphs [PDF]
Opuscula Mathematica, 2009 We show that if a graph \(G\) on \(n\) edges allows certain special type of rosy labeling (a.k.a. \(\rho\)-labeling), called \(\alpha_2\)-labeling, then for any positive integer \(k\) the complete graph \(K_{2nk+1}\) can be decomposed into copies of \(G\)
Dalibor Fronček
doaj +1 more source
Optimizing tree decompositions in MSO [PDF]
Logical Methods in Computer Science, 2022 The classic algorithm of Bodlaender and Kloks [J. Algorithms, 1996] solves the following problem in linear fixed-parameter time: given a tree decomposition of a graph of (possibly suboptimal) width k, compute an optimum-width tree decomposition of the ...
Mikołaj Bojańczyk, Michał Pilipczuk
doaj +1 more source
On tree-decompositions of one-ended graphs [PDF]
, 2018 A graph is one-ended if it contains a ray (a one way infinite path) and whenever we remove a finite number of vertices from the graph then what remains has only one component which contains rays. A vertex $v$ {\em dominates} a ray in the end if there are
Carmesin, Johannes +2 more
core +2 more sources
The Spectrum Problem for the Connected Cubic Graphs of Order 10
Discussiones Mathematicae Graph Theory, 2021 We show that if G is a connected cubic graph of order 10, then there exists a G-decomposition of Kv if and only if v ≣ 1 or 10 (mod 15) except when v = 10 and G is one of 5 specific graphs.
Adams Peter +3 more
doaj +1 more source
A C3 Magic Decomposition on Friendship Graph with Odd Order
Jurnal Ilmu Dasar, 2022 Let G = (V,E) is graph with a non-empty set V containing vertices and a set of edges E. Also note that if H = {H_i⊆G_i = 1,2,3,...,n} is a collection of subgraphs from G with H_i≅Hj,i ≠ j.
Indah Chairun Nisa +2 more
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
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
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
Packing and Decomposition of Graphs with Trees [PDF]
Journal of Combinatorial Theory, Series B, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Raphael Yuster
openalex +3 more sources