The Complexity of the Evolution of Graph Labelings

Abstract

We study the Graph Relabeling Problem-given an undirected, connected, simple graph G = (V, E), two labelings L and L ′ of G, and label flip or mutation functions determine the complexity of transforming or evolving the labeling L into L ′ . The transformation of L into L ′ can be viewed as an evolutionary process governed by the types of flips or mutations allowed. The number of applications of the function is the duration of the evolutionary period. The labels may reside on the vertices or the edges. We prove that vertex and edge relabelings have closely related computational complexities. Upper and lower bounds on the number of mutations required to evolve one labeling into another in a general graph are given. Exact bounds for the number of mutations required to evolve paths and stars are given. This corresponds to computing the exact distance between two vertices in the corresponding Cayley graph. We finally explore both vertex and edge relabeling with privileged labels, and resolve some open problems by providing precise characterizations of when these problems are solvable. Many of our results include algorithms for solving the problems, and in all cases the algorithms are polynomial-time. The problems studied have applications in areas such as bioinformatics, networks, and VLSI.

Informatics-Aided Density Functional Theory Study on the Li Ion Transport of Tavorite-Type LiMTO4F (M3+–T5+, M2+–T6+)

“…However, when we tested our multivariate data set, the first principal component (PC1) from PCA can only weakly explain for the data variability, that is, only 32% of the variance has been explained; PC2 and PC3 each both have 20% of the variance explained (see Figure S1 in the Supporting Information). So instead, co-occurrence patterns were analyzed using graph theory and a selection scheme based on Pearson product-moment correlation coefficient R . We set a condition for determining the presence of strong collinearity: for | R | > 0.5, two distinct variables are considered strongly collinear; otherwise, they are treated to be independent from each other.…”

Exploring the Impact of Hand Dominance on Laparoscopic Surgical Skills Development Using Network Models

“…Network density, a fundamental measure in graph theory, was employed to assess the overall connectivity and complexity of hand movements during the laparoscopic simulation tasks. It is defined as the ratio of the number of actual edges in the network to the total possible number of edges [31]. A higher network density indicates a greater level of interconnectedness among participants' hand movements, suggesting increased coordination and information flow within the network.…”

C26. An Integrated Power-efficient Mapping and Routing Technique for Mesh-based Networks-on-Chip

“…E is a set of edges that represent the logical communication channels between PEs. ψ is the graph mapping incident function ψ : E  V  V, which maps an edge onto a pair of vertices (vi,vj) [24].…”