Results 241 to 250 of about 254,638 (264)
Some of the next articles are maybe not open access.
Unleashing the Power of Information Graphs
ACM SIGMOD Record, 2015Information 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.
Matteo Lissandrini +4 more
openaire +2 more sources
Proceedings of the sixteenth annual ACM symposium on Theory of computing - STOC '84, 1984
In this paper we investigate a powerful, and yet simple, technique for devising approximation algorithms for a wide variety of NP-complete problems in routing, location, and communication network design. Each of the algorithms presented here delivers an approximate solution guaranteed to be within a constant factor of the optimal solution. In addition,
Dorit S. Hochbaum, David B. Shmoys
openaire +1 more source
In this paper we investigate a powerful, and yet simple, technique for devising approximation algorithms for a wide variety of NP-complete problems in routing, location, and communication network design. Each of the algorithms presented here delivers an approximate solution guaranteed to be within a constant factor of the optimal solution. In addition,
Dorit S. Hochbaum, David B. Shmoys
openaire +1 more source
Coloring Powers of Chordal Graphs
SIAM Journal on Discrete Mathematics, 2004Summary: We prove that the \(k\)th power \(G^{k}\) of a chordal graph \(G\) with maximum degree \(\Delta\) is \(O(\sqrt{k}\Delta^{(k+1)/2})\)-degenerate for even values of \(k\) and \(O(\Delta^{(k+1)/2})\)-degenerate for odd values. In particular, this bounds the chromatic number \(\chi(G^k)\) of the \(k\)th power of \(G\).
openaire +1 more source
Comparing the Power of Games on Graphs
Mathematical Logic Quarterly, 1997AbstractThe descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descriptive complexity is to make use of games on graphs played between two players, called the spoiler and the duplicator. There are two types of these games, which differ in
openaire +1 more source
Applying Power Graph Analysis to Weighted Graphs
2012We expanded Power Graph Analysis for use with weighted graphs, applying the technique to document categorisation with promising results. With the additional weight information we were able to create more accurate representations of the underlying data while maintaining a high level of edge reduction and improving visualisation of the graph.
openaire +1 more source
Multi-Meteorological-Factor-Based Graph Modeling for Photovoltaic Power Forecasting
IEEE Transactions on Sustainable Energy, 2021Guoqiang Sun, Tao Ding, Zhinong Wei
exaly
On the enhanced power graph of a finite group
Communications in Algebra, 2021Ramesh Prasad Panda +2 more
exaly
A Spatiotemporal Directed Graph Convolution Network for Ultra-Short-Term Wind Power Prediction
IEEE Transactions on Sustainable Energy, 2023Yongning Zhao, Lin Ye, Ming Pei
exaly
Between the enhanced power graph and the commuting graph
Journal of Graph Theory, 2023Peter Cameron, Bojan Kuzma
exaly
Spatio-Temporal Graph Neural Networks for Multi-Site PV Power Forecasting
IEEE Transactions on Sustainable Energy, 2022Baptiste Schubnel +2 more
exaly