Graph Decomposition
3 Followers
Recent papers in Graph Decomposition
A graceful labeling of a graph G with n edges is an injection f : V (G) →{ 0,1,2,···,n} with the property that the resulting edge labels are also distinct, where an edge incident with vertices u and v is assigned the label |f(u)−f(v)|. A... more
A labeling (or valuation) of a graph G is an assignment of integers to the vertices of G subject to certain conditions. A hierarchy of graph labelings was introduced by Rosa in the late 1960s. Rosa showed that certain basic labelings of a... more
Evolutionary algorithms (EAs) have been widely used in handling various water resource optimization problems in recent years. However, it is still challenging for EAs to identify near-optimal solutions for realistic problems within the... more
During the last three decades, different types of decompositions have been pro- cessed in thefield of graph theory. Among these we mention: decompositions based on the additivity of some characteristics of the graph, decompositions where... more
Development of robust dynamical systems and networks such as autonomous aircraft systems capable of accomplishing complex missions faces challenges due to the dynamically evolving uncertainties coming from model uncertainties, necessity... more
System-level modeling, simulation, and synthesis using electronic design automation (EDA) tools are key steps in the design process for communication and signal processing systems, and the synchronous dataflow (SDF) model of computation... more
Development of robust dynamical systems and networks such as autonomous aircraft systems capable of accomplishing complex missions faces challenges due to the dynamically evolving uncertainties coming from model uncertainties, necessity... more
Traditional intrusion detection systems (IDSs) focus on low-level attacks or anomalies, and raise alerts independently, though there may be logical connections between them. In situations where there are intensive intrusions, not only... more
This paper explores the embeddings of multidimensional meshes into minimal Boolean cubes by graph decomposition. The dilation and the congestion of the product graph (G1 × G2) → (H1 × H2) is the maximum of the dilation and congestion for... more
The question of finding feasible ways for estimating probability distributions is one of the main challenges for Estimation of Distribution Algorithms (EDAs). To estimate the distribution of the selected solutions, EDAs use factorizations... more