Results 211 to 220 of about 5,865,138 (250)

Dynamic topology-aware multimodal hypergraph fusion network for load forecasting in novel power systems. [PDF]

Sci Rep
Lv X, Ma Q, Du J.
europepmc   +1 more source

Nonintrusive Power Load Decomposition Based on Adaptive Graph Convolutional Neural Network. [PDF]

Sensors (Basel)
Zhao P, Wei J, Wang L, Qiu Y.
europepmc   +1 more source

Stacked graph attention network hypertuned by Heteroscedastic and Evolutionary Bayesian Optimization for fault identification on nuclear power plants robust to sensor drift. [PDF]

Sci Rep
Stefenon SF, Yow KC.
europepmc   +1 more source

Power Graphs: A Survey

Electronic Journal of Graph Theory and Applications, 2013
This article gives a survey of all results on the power graphs of groups and semigroups obtained in the literature. Various conjectures due to other authors, questions and open problems are also included.
Jemal Abawajy, Andrei Kelarev, Morshed Chowdhury   +2 more
exaly   +5 more sources

Some of the next articles are maybe not open access.

Related searches:

On the Power of Graph Searching for Cocomparability Graphs

SIAM Journal on Discrete Mathematics, 2016
In this paper we study how graph searching on a cocomparability graph $G$ can be used to produce cocomp orderings (i.e., orderings that are linear extensions of some transitive orientation of $\overline{G}$) that yield simple algorithms for various intractable problems in general. Such techniques have been used to find a simple certifying algorithm for
Corneil, Derek G., Dusart, Jérémie, Habib, Michel, Köhler, Ekkerhard   +3 more
openaire   +3 more sources

On the Difference of the Enhanced Power Graph and the Power Graph of a Finite Group

Journal of Combinatorial Theory - Series A
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Angsuman Das, Peter Cameron
exaly   +5 more sources

Coloring Powers of Planar Graphs

SIAM Journal on Discrete Mathematics, 2003
We give nontrivial boundsfor the inductiveness or degeneracy of power graphs G k of a planar graph G. This implies bounds for the chromatic number as well, since the inductiveness naturally relates to a greedy algorithm for vertex-coloring the given graph.
Geir Agnarsson, Magnús M. Halldórsson
openaire   +5 more sources