Results 11 to 20 of about 2,245,805 (347)
Shortest Beer Path Queries based on Graph Decomposition [PDF]
International Symposium on Algorithms and Computation, 2023 Given a directed edge-weighted graph $G=(V, E)$ with beer vertices $B\subseteq V$, a beer path between two vertices $u$ and $v$ is a path between $u$ and $v$ that visits at least one beer vertex in $B$, and the beer distance between two vertices is the ...
T. Hanaka +3 more
semanticscholar +1 more source
High-Order Pooling for Graph Neural Networks with Tensor Decomposition [PDF]
Neural Information Processing Systems, 2022 Graph Neural Networks (GNNs) are attracting growing attention due to their effectiveness and flexibility in modeling a variety of graph-structured data. Exiting GNN architectures usually adopt simple pooling operations (eg.
Chenqing Hua +2 more
semanticscholar +1 more source
Temporal Graph Signal Decomposition [PDF]
Knowledge Discovery and Data Mining, 2021 Temporal graph signals are multivariate time series with individual components associated with nodes of a fixed graph structure. Data of this kind arises in many domains including activity of social network users, sensor network readings over time, and ...
M. McNeil, Lin Zhang, Petko Bogdanov
semanticscholar +1 more source
Knowledge Graph Reasoning Based on Tensor Decomposition and MHRP-Learning
Advances in Multimedia, 2021 In the process of learning and reasoning knowledge graph, the existing tensor decomposition technology only considers the direct relationship between entities in knowledge graph. However, it ignores the characteristics of the graph structure of knowledge
Tangsen Huang +3 more
doaj +1 more source
Eulerian Cycle Decomposition Conjecture for the line graph of complete graphs
AKCE International Journal of Graphs and Combinatorics, 2019 The Eulerian Cycle Decomposition Conjecture, by Chartrand, Jordon and Zhang, states that if the minimum number of odd cycles in a cycle decomposition of an Eulerian graph G of size m is a, the maximum number of odd cycles in such a cycle decomposition is
R. Rajarajachozhan, R. Sampathkumar
doaj +2 more sources
An Efficient Subgraph Isomorphism Solver for Large Graphs
IEEE Access, 2021 For a given pair of pattern and data graphs, the subgraph isomorphism finding problem locates all instances of the pattern graph into the data graph. For a given subgraph isomorphic image of the pattern graph in a data graph, the set of all ordered pairs
Zubair Ali Ansari +2 more
doaj +1 more source
Constrained ear decompositions in graphs and digraphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 Ear decompositions of graphs are a standard concept related to several major problems in graph theory like the Traveling Salesman Problem. For example, the Hamiltonian Cycle Problem, which is notoriously N P-complete, is equivalent to deciding whether a ...
Frédéric Havet, Nicolas Nisse
doaj +1 more source
End-to-End Learning for Graph Decomposition [PDF]
IEEE International Conference on Computer Vision, 2018 Deep neural networks provide powerful tools for pattern recognition, while classical graph algorithms are widely used to solve combinatorial problems. In computer vision, many tasks combine elements of both pattern recognition and graph reasoning.
Jie Song +4 more
semanticscholar +1 more source
Method of Service Decomposition Based on Microservice Architecture [PDF]
Jisuanji kexue, 2021 The microservice decomposition of the monolithic system can effectively alleviate the problems of system redundancy and difficulty in maintenance of the monolithic architecture.However,the existing microservice decomposition methods fail to make full use
JIANG Zheng, WANG Jun-li, CAO Rui-hao, YAN Chun-gang
doaj +1 more source
Capturing Polynomial Time using Modular Decomposition [PDF]
Logical Methods in Computer Science, 2019 The question of whether there is a logic that captures polynomial time is one of the main open problems in descriptive complexity theory and database theory.
Berit Grußien
doaj +1 more source