Results 21 to 30 of about 1,157,203 (300)
Some results on Steiner decomposition number of graphs
Kuwait Journal of Science, 2023 Let $G$ be a connected graph with Steiner number $s(G)$. A decomposition $\pi=\{G_1, G_2,..., G_n\}$ is said to be a Steiner decomposition if $s(G_i)=s(G)$ for all $i\:(1\leq i\leq n)$. The maximum cardinality obtained for the Steiner decomposition $\pi$
E.Ebin Raja Merly, M.Mahiba
doaj +1 more source
TD-H2H: Shortest Path Query on Time-Dependent Graphs [PDF]
Jisuanji kexue yu tansuo, 2023 A shortest path query on road networks is a fundamental problem, which has been studied widely. Existing studies usually model road networks as a static graph and query the path with the shortest distance between given vertices.
LI Xinling, WANG Yishu, YUAN Ye, GU Xiang, WANG Guoren
doaj +1 more source
Decomposition of Graphs on Surfaces
Journal of Combinatorial Theory, Series B, 1997 For \(G= (V,E)\) an Eulerian graph imbedded on a triangulizable surface \(S\), \(\text{mincr}(G, D)\) denotes the minimum number of intersections of \(G\) and \(D'\) (counting multiplicities), where \(D'\) ranges over all closed curves freely homotopic to \(D\) and not intersecting \(V\).
de Graaf, M., Schrijver, A.
openaire +6 more sources
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
Edge-partitioning graphs into regular and locally irregular components [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 A graph is locally irregular if every two adjacent vertices have distinct degrees. Recently, Baudon et al. introduced the notion of decomposition into locally irregular subgraphs.
Julien Bensmail, Brett Stevens
doaj +1 more source
Structural Decomposition Model for the Evolution of AS-Level Internet Topologies
IEEE Access, 2020 Modeling Internet graphs at the autonomous-system (AS) level is helpful for recognizing and predicting the development trend of evolving Internet topology from a macro perspective.
Bo Jiao, Wensheng Zhang
doaj +1 more source
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 +4 more sources
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
Local Balance in Graph Decompositions [PDF]
Graphs and Combinatorics, 2022 In a balanced graph decomposition, every vertex of the host graph appears in the same number of blocks. We propose the use of colored loops as a framework for unifying various other types of local balance conditions in graph decompositions. In the basic case where a single graph with colored loops is used as a block, an existence theory for such ...
Flora C. Bowditch, Peter J. Dukes
openaire +2 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