Results 11 to 20 of about 1,157,203 (300)
Time complexity analysis of generalized decomposition algorithm [PDF]
, 1997 The time complexity of the fast algorithm for generalized disjunctive decomposition of an rvalued function is studied.The considered algorithm to find the best decomposition is based on the analysis of multiple-terminal multiple-valued decision diagrams.
Pshibytko, V, Kalganova, T
core +6 more sources
A Heuristic for Direct Product Graph Decomposition [PDF]
, 2023 In this paper we describe a heuristic for decomposing a directed graph into factors according to the direct product (also known as Kronecker, cardinal or tensor product). Given a directed, unweighted graph G with adjacency matrix Adj(G), our heuristic
Moreno Marzolla +2 more
core +1 more source
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
A Variation of Decomposition Under a Length Constraint [PDF]
, 2011 Introducing and initiating a study of a new variation of decomposition namely equiparity induced path decomposition of a graph which is defined to be a decomposition in which all the members are induced paths having same ...
Joseph, Mayamma +3 more
core +1 more source
Decomposition of complete graphs into small graphs [PDF]
Opuscula Mathematica, 2010 In 1967, A. Rosa proved that if a bipartite graph \(G\) with \(n\) edges has an \(\alpha\)-labeling, then for any positive integer \(p\) the complete graph \(K_{2np+1}\) can be cyclically decomposed into copies of \(G\).
Dalibor Froncek
doaj +1 more source
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 +2 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
Note on decompositions based on the vertex-removing synchronised graph product
Electronic Journal of Graph Theory and Applications, 2022 Recently, we have introduced two graph-decomposition theorems based on a new graph product, motivated by applications in the context of synchronising periodic real-time processes. This vertex-removing synchronised product (VRSP) is based on modifications
Antoon Hendrik Boode
doaj +1 more source
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