Results 21 to 30 of about 2,192,848 (347)

Method of Service Decomposition Based on Microservice Architecture [PDF]

Jisuanji kexue, 2021
The microservice decomposition of the monolithic system can effectively alleviate the problems of system redundancy and difficulty in maintenance of the monolithic architecture.However,the existing microservice decomposition methods fail to make full use
JIANG Zheng, WANG Jun-li, CAO Rui-hao, YAN Chun-gang
doaj   +1 more source

The monadic second-order logic of graphs XVI : Canonical graph decompositions [PDF]

Logical Methods in Computer Science, 2006
This article establishes that the split decomposition of graphs introduced by Cunnigham, is definable in Monadic Second-Order Logic.This result is actually an instance of a more general result covering canonical graph decompositions like the modular ...
Bruno Courcelle
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

Graph decompositions in projective geometries [PDF]

Journal of Combinatorial Designs, 2020
AbstractLet PG be the ‐dimensional projective space over and let be a simple graph of order for some . A design over is a collection of graphs (blocks) isomorphic to with the following properties: the vertex set of every block is a subspace of PG; every two distinct points of PG are adjacent in exactly blocks.
Marco Buratti, Anamari Nakić, Alfred Wassermann   +2 more
openaire   +4 more sources

Decomposition of product graphs into paths and stars on five vertices

AKCE International Journal of Graphs and Combinatorics, 2020
Let Sk and Kk respectively denote a path, a star and a complete graph on k vertices. By a -decomposition of a graph G, we mean a decomposition of G into r copies of and s copies of In this paper, it shown that the graph admits a -decomposition if and ...
M. Ilayaraja, K. Sowndhariya, A. Muthusamy   +2 more
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   +5 more sources

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

Graph decompositions without isolates

Journal of Combinatorial Theory, Series B, 1984
A. Frank conjectured that if \(G=(V,E)\) is a connected graph with minimal degree \(\geq k\) and \(a_ 1,...,a_ k\geq 2\) are integers with \(\sum a_ i=| V|\), then V may be decomposed into \(A_ 1,...,A_ k\), such that \(| A_ i| =a_ i\) and the subgraph induced by \(A_ i\) in G has no isolated vertices \((i=1,...,k)\).
Nathan Linial
openalex   +2 more sources

I/O efficient Core Graph Decomposition at web scale [PDF]

IEEE International Conference on Data Engineering, 2015
Core decomposition is a fundamental graph problem with a large number of applications. Most existing approaches for core decomposition assume that the graph is kept in memory of a machine.
Dong Wen, Lu Qin, Ying Zhang, Xuemin Lin, J. Yu   +4 more
semanticscholar   +1 more source