Results 331 to 340 of about 8,004,238 (365)
Some of the next articles are maybe not open access.
On the Power of Graph Searching for Cocomparability Graphs
SIAM Journal on Discrete Mathematics, 2016In this paper we study how graph searching on a cocomparability graph G can be used to pro- duce cocomp orderings, (i.e., orderings that are linear extensions of some transitive orientation of G) that yield simple algorithms for various intractable problems in general. Such techniques have been used to find a simple certifying algorithm for the minimum
Corneil, Derek G. +3 more
openaire +3 more sources
On the power sequence of a graph
Israel Journal of Mathematics, 1970Necessary and sufficient conditions for a sequence (p 1,p 2, …,p n ) of positive integers to be the power sequence of a connected graph onn vertices withm edges are given. The maximum power of a connected graph onn vertices withm edges and the class of all extremal graphs
A. Ramachandra Rao, S. B. Rao
openaire +2 more sources
A Physics-Guided Graph Convolution Neural Network for Optimal Power Flow
IEEE Transactions on Power SystemsThe data-driven method with strong approximation capabilities and high computational efficiency provides a promising tool for optimal power flow (OPF) calculation with stochastic renewable energy.
Maosheng Gao +3 more
semanticscholar +1 more source
On the power graph and the reduced power graph of a finite group
Communications in Algebra, 2019In this paper, for a finite group, we investigate to what extent its directed (resp. undirected) reduced power graph determines its directed power graph (resp. reduced power graph).
T. Anitha, R. Rajkumar
openaire +2 more sources
IEEE Transactions on Power Systems
The scale-up of AI models for analyzing large-scale power systems necessitates a thorough understanding of their scaling properties. Existing studies on these properties provide only partial insights, showing predictable decreases in loss function with ...
Yuhong Zhu +5 more
semanticscholar +1 more source
The scale-up of AI models for analyzing large-scale power systems necessitates a thorough understanding of their scaling properties. Existing studies on these properties provide only partial insights, showing predictable decreases in loss function with ...
Yuhong Zhu +5 more
semanticscholar +1 more source
Graphs whose powers are chordal and graphs whose powers are interval graphs
Journal of Graph Theory, 1997The main theorem of this paper gives a forbidden induced subgraph condition on \(G\) that is sufficient for chordality of \(G^m\). This theorem is a generalization of a theorem of Balakrishnan and Paulraja who had provided this only for \(m=2\).
openaire +3 more sources
GRANNITE: Graph Neural Network Inference for Transferable Power Estimation
Design Automation Conference, 2020This paper introduces GRANNITE, a GPU-accelerated novel graph neural network (GNN) model for fast, accurate, and transferable vector-based average power estimation.
Yanqing Zhang +2 more
semanticscholar +1 more source
Unleashing the Power of Information Graphs [PDF]
ACM SIGMOD Record, 2015 Information graphs are generic graphs that model different types of information through nodes and edges. Knowledge graphs are the most common type of information graphs in which nodes represent entities and edges represent relationships among them.
Lissandrini, Matteo +4 more
openaire +2 more sources
Coloring Powers of Planar Graphs
SIAM Journal on Discrete Mathematics, 2003Summary: We give nontrivial bounds for 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
Creating Knowledge Graph of Electric Power Equipment Faults Based on BERT–BiLSTM–CRF Model
Journal of Electrical Engineering and Technology, 2022Fanqi Meng +4 more
semanticscholar +1 more source