Results 1 to 10 of about 86,414 (147)
Graph neural networks with configuration cross-attention for tensor compilers [PDF]
Frontiers in Artificial IntelligenceWith the recent popularity of neural networks comes the need for efficient serving of inference workloads. A neural network inference workload can be represented as a computational graph with nodes as operators transforming multidimensional tensors.
Dmitrii Khizbullin +4 more
doaj +2 more sources
Forbidden configurations for hypohamiltonian graphs [PDF]
Opuscula Mathematica, 2018 A graph \(G\) is called hypohamiltonian if \(G\) is not hamiltonian, but \(G-x\) is hamiltonian for each vertex \(x\) of \(G\). We present a list of 331 forbidden configurations which do not appear in hypohamiltonian graphs.
Igor Fabrici +2 more
doaj +2 more sources
Graph pebbling number and model [PDF]
ریاضی و جامعه, 2023 There are many topics in graph theory that can be called ``moving objects around a graph". For example; In network optimization, shipments are transferred from some vertices (resources) to other vertices (demand) according to the costs allocated to the ...
Fatemeh Aghaei Meybodi, Saeed Alikhani
doaj +1 more source
The structure and the list 3-dynamic coloring of outer-1-planar graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 An outer-1-planar graph is a graph admitting a drawing in the plane so that all vertices appear in the outer region of the drawing and every edge crosses at most one other edge.
Yan Li, Xin Zhang
doaj +1 more source
Conversion Method from Relational Database to Graph Database [PDF]
Jisuanji kexue, 2021 Due to the differences between the storage mode of relational database and graph database,during the process of transforming data in relational database to graph database,it is necessary to solve the main problems of edge definition,vertex uniqueness and
E Hai-hong, HAN Peng-hao, SONG Mei-na
doaj +1 more source
Counting r-graphs without forbidden configurations
Journal of Combinatorial Theory, Series B, 2022 One of the major problems in combinatorics is to determine the number of $r$-uniform hypergraphs ($r$-graphs) on $n$ vertices which are free of certain forbidden structures. This problem dates back to the work of Erd s, Kleitman and Rothschild, who showed that the number of $K_r$-free graphs on $n$ vertices is $2^{\text{ex}(n,K_r)+o(n^2)}$. Their work
József Balogh +2 more
openaire +2 more sources
Introduction to local certification [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 A distributed graph algorithm is basically an algorithm where every node of a graph can look at its neighborhood at some distance in the graph and chose its output.
Laurent Feuilloley
doaj +1 more source
A Graph Grammar for Modelling RNA Folding [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 We propose a new approach for modelling the process of RNA folding as a graph transformation guided by the global value of free energy. Since the folding process evolves towards a configuration in which the free energy is minimal, the global behaviour ...
Adane Letta Mamuye +2 more
doaj +1 more source
Graph homology and graph configuration spaces [PDF]
Journal of Homotopy and Related Structures, 2012 If $R$ is a commutative ring, $M$ a compact $R$-oriented manifold and $G$ a finite graph without loops or multiple edges, we consider the graph configuration space $M^G$ and a Bendersky-Gitler type spectral sequence converging to the homology $H_*(M^G, R)$.
Baranovsky, Vladimir +1 more
openaire +3 more sources
A GRAPH BASED MODEL FOR THE DETECTION OF TIDAL CHANNELS USING MARKED POINT PROCESSES [PDF]
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2015 In this paper we propose a new method for the automatic extraction of tidal channels in digital terrain models (DTM) using a sampling approach based on marked point processes.
A. Schmidt +3 more
doaj +1 more source