Results 301 to 310 of about 2,125,479 (331)

GRAPH EQUATIONS FOR LINE GRAPHS, TOTAL GRAPHS AND MIDDLE GRAPHS

GRAPH EQUATIONS FOR LINE GRAPHS, TOTAL GRAPHS AND MIDDLE GRAPHS
openaire  

Some of the next articles are maybe not open access.

Related searches:

LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation

Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2020
Graph Convolution Network (GCN) has become new state-of-the-art for collaborative filtering. Nevertheless, the reasons of its effectiveness for recommendation are not well understood.
Xiangnan He, Kuan Deng, Xiang Wang, Yan Li, Yongdong Zhang, Meng Wang   +5 more
semanticscholar   +1 more source

Graph Attention Networks

International Conference on Learning Representations, 2017
We present graph attention networks (GATs), novel neural network architectures that operate on graph-structured data, leveraging masked self-attentional layers to address the shortcomings of prior methods based on graph convolutions or their ...
Petar Velickovic, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Liò, Yoshua Bengio   +5 more
semanticscholar   +1 more source

Modeling Relational Data with Graph Convolutional Networks

Extended Semantic Web Conference, 2017
Knowledge graphs enable a wide variety of applications, including question answering and information retrieval. Despite the great effort invested in their creation and maintenance, even the largest (e.g., Yago, DBPedia or Wikidata) remain incomplete.
M. Schlichtkrull, Thomas Kipf, Peter Bloem, Rianne van den Berg, Ivan Titov, M. Welling   +5 more
semanticscholar   +1 more source

YAO GRAPHS SPAN THETA GRAPHS

Discrete Mathematics, Algorithms and Applications, 2010
Yao and Theta graphs are defined for a given point set and a fixed integer k > 0. The space around each point is divided into k cones of equal angle, and each point is connected to a nearest neighbor in each cone. The difference between Yao and Theta graphs is in the way the nearest neighbor is defined: Yao graphs minimize the Euclidean distance ...
Damian, Mirela, Raudonis, Kristin
openaire   +2 more sources

GRAPH PROCESSES

Fundamenta Informaticae, 1996
We first give a new definition of graph grammars, which, although following the algebraic double-pushout approach, is more general than the classical one because of the use of a graph of types where all involved graphs are mapped to. Then, we develop a process-based semantics for such (typed) graph grammars, in the line of processes as normally used ...
CORRADINI, ANDREA, MONTANARI, UGO GIOVANNI ERASMO, Rossi F.   +2 more
openaire   +4 more sources

Spectral graph theory

Zeta and 𝐿-functions in Number Theory and Combinatorics, 2019
Spectral graph theory is a vast and expanding area of combinatorics. We start these notes by introducing and motivating classical matrices associated with a graph, and then show how to derive combinatorial properties of a graph from the eigenvalues of ...
Amol Sahebrao Hinge
semanticscholar   +1 more source

Specifying Knowledge Graph with Data Graph, Information Graph, Knowledge Graph, and Wisdom Graph

International Journal of Software Innovation, 2018
Knowledge graphs have been widely adopted, in large part owing to their schema-less nature. It enables knowledge graphs to grow seamlessly and allows for new relationships and entities as needed. A knowledge graph is a graph constructed by representing each item, entity and user as nodes, and linking those nodes that interact with each other via edges.
Yucong Duan, Lixu Shao, Gongzhu Hu
openaire   +1 more source

Graphs

Chest, 2006
Two rules of good graphs are presented and explicated.
openaire   +2 more sources