Results 301 to 310 of about 4,096,731 (342)
Some of the next articles are maybe not open access.
GraFormer: Graph-oriented Transformer for 3D Pose Estimation
Computer Vision and Pattern Recognition, 2022In 2D-to-3D pose estimation, it is important to exploit the spatial constraints of 2D joints, but it is not yet well modeled. To better model the relation of joints for 3D pose estimation, we propose an effective but simple net-work, called ...
Weixi Zhao, Weiqiang Wang, Yunjie Tian
semanticscholar +1 more source
Data Fusion Oriented Graph Convolution Network Model for Rumor Detection
IEEE Transactions on Network and Service Management, 2020With the rapid development of Mobile Internet, social media platforms explosively grow and greatly facilitate people to obtain and exchange information. Since any users can post arbitrary information on social media, some people with ulterior motives try
K. Yu +4 more
semanticscholar +1 more source
Transitive Orientations of Graphs
SIAM Journal on Computing, 1988Consider an acyclic orientation of the edges of a graph G of order n and relative size p. The partial order obtained by transitive closure is called the transitive orientation of G. Let t(G) be the maximum number of unrelated pairs for different orders, and t(n,p) its minimum over G for fixed n and p. Bounds on t(n,p) are given throughout the range of \
Béla Bollobás, Graham R. Brightwell
openaire +3 more sources
On the orientation of meyniel graphs
Journal of Graph Theory, 1994AbstractA kernel of a directed graph is a set of vertices K that is both absorbant and independent (i.e., every vertex not in K is the origin of an arc whose extremity is in K, and no arc of the graph has both endpoints in K). In 1983, Meyniel conjectured that any perfect graph, directed in such a way that every circuit of length three uses two ...
Mostafa Blidia +2 more
openaire +1 more source
Bipartitions of oriented graphs
Journal of Combinatorial Theory Series B, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shufei Wu, Jianfeng Hou
exaly +4 more sources
Graph Matching in Graph-Oriented Databases
2021Modern graph database management systems use graph structures for semantic queries with nodes, edges, and properties to connect to and store information. Due to their schema-less nature, inappropriate data migration and manipulation can lead to severe data loss during the data query process.
Soumaya Boukettaya +2 more
openaire +2 more sources
Journal of Graph Theory, 2001
The orientation distance between two orientations \(D\) and \(D'\) of a graph \(G\) is the minimum number of edges of \(G\) whose orientation needs to be reversed to transform \(D\) into an orientation isomorphic to \(D'\). The orientation distance graph with respect to \(G\) is a graph whose vertex set is a certain set of such orientations and in ...
Gary Chartrand +3 more
openaire +3 more sources
The orientation distance between two orientations \(D\) and \(D'\) of a graph \(G\) is the minimum number of edges of \(G\) whose orientation needs to be reversed to transform \(D\) into an orientation isomorphic to \(D'\). The orientation distance graph with respect to \(G\) is a graph whose vertex set is a certain set of such orientations and in ...
Gary Chartrand +3 more
openaire +3 more sources
CommDGI: Community Detection Oriented Deep Graph Infomax
International Conference on Information and Knowledge Management, 2020Graph Neural Networks(GNNs), like GCN and GAT, have achieved great success in a number of supervised or semi-supervised tasks including node classification and link prediction.
Tianqi Zhang +5 more
semanticscholar +1 more source
Journal of Graph Theory, 1994
AbstractLet D be an oriented graph of order n ≧ 9 and minimum degree n − 2. This paper proves that D is pancyclic if for any two vertices u and v, either uv ≅ A(D), or dD+(u) + dD−(v) ≧ n − 3.
openaire +3 more sources
AbstractLet D be an oriented graph of order n ≧ 9 and minimum degree n − 2. This paper proves that D is pancyclic if for any two vertices u and v, either uv ≅ A(D), or dD+(u) + dD−(v) ≧ n − 3.
openaire +3 more sources
Journal of Graph Theory, 1982
AbstractLet C(v1, …,vn) be a system consisting of a circle C with chords v1, …,vn on it having different endpoints. Define a graph G having vertex set V(G) = {v1, …,vn} and for which vertices vi and vj are adjacent in G if the chords vi and vj intersect. Such a graph will be called a circle graph.
Ronald C. Read +2 more
openaire +1 more source
AbstractLet C(v1, …,vn) be a system consisting of a circle C with chords v1, …,vn on it having different endpoints. Define a graph G having vertex set V(G) = {v1, …,vn} and for which vertices vi and vj are adjacent in G if the chords vi and vj intersect. Such a graph will be called a circle graph.
Ronald C. Read +2 more
openaire +1 more source