The NP-complete Closest 4-Leaf Power problem asks, given an undirected graph, whether it can be modified by at most ` edge insertions or deletions such that it becomes a 4-leaf power. Herein, a 4-leaf power is a graph that can be constructed by considering an unrooted tree—the 4-leaf root—with leaves one-to-one labeled by the graph vertices, where we connect two graph vertices by an edge iff th...

Graph analysis is a fundamental building block in numerous computing domains. Recent research has looked into harnessing GPUs to achieve necessary throughput goals. However, comparatively little attention has been paid to improving the power-constrained performance of these applications. Through firmware changes on a state-of-the-art commodity GPU, we characterize the power consumption of Bread...

the harmonic in distribution systems becomes an important problem due to an increase in nonlinear loads. this paper presents a new approach based on a graph algorithm for optimum placement of passive harmonic filters in a multi-bus system, which suffers from harmonic current sources. the objective of this paper is to minimize the network loss, the cost of the filter and the total harmonic disto...

This manuscript will provide a step by step method on how a graph theory and topology can be utilized to construct a Z-loop matrix for the study of faulted 3 phase power systems. The growing demand for reliable electrical power supply has forced the pace developments in electrical power system analysis using computer. In this, power system analysis plays a significant role for the analysis of f...

The applications of super-resolution (SR) technology in the field image completion are successful. Nevertheless, industry demand not only but also topology and time-series completion. In this article, SR on a graph is studied scenario recovering measurements power distribution systems for cost saving security & stability improvement. flow voltage magnitude feeders reported at different frequenc...

A $P_4$-free graph is called a cograph. In this paper we partially characterize finite groups whose power As will see, problem generalization of the determination in which every element has prime order, first raised by Graham Higman 1957 and fully solved very recently. First determine all $G$ $H$ for $G\times H$ We show that cograph can be characterised condition only involving elements orders ...