Results 271 to 280 of about 845,850 (303)

Learning Graph Embedding With Adversarial Training Methods

IEEE Transactions on Cybernetics, 2020
Graph embedding aims to transfer a graph into vectors to facilitate subsequent graph-analytics tasks like link prediction and graph clustering. Most approaches on graph embedding focus on preserving the graph structure or minimizing the reconstruction ...
Jing Jiang, Chengqi Zhang, Sai-Fu Fung
exaly   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Rectilinear Graphs and Their Embeddings

SIAM Journal on Computing, 1985
Adapted from the authors' introduction: ''The problem we address in this paper is an embedding problem for a class of graphs which we call rectilinear graphs. These graphs are important in many VLSI layout problems. In fact, this problem arose in the implementation of ALI, a procedural language for VLSI design currently under development at Princeton ...
Gopalakrishnan Vijayan, Avi Wigderson
openaire   +3 more sources

Simultaneous Embedding of Embedded Planar Graphs

International Journal of Computational Geometry & Applications, 2011
A simultaneous embedding with fixed edges (SEFE) of a set of k planar graphs G1,…,Gk on the same set of vertices is a set of k planar drawings of G1,…,Gk, respectively, such that each vertex is placed on the same point in all the drawings and each edge is represented by the same Jordan curve in the drawings of all the graphs it belongs to.
Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati   +2 more
openaire   +3 more sources

Embedding graphs in Cayley graphs

Graphs and Combinatorics, 1987
Over ten years ago Babai showed that for any graph Y and for any sufficiently large group G, there is a Cayley graph X of G such that Y is an induced subgraph of X. The bounds given by him for \(| G|\) have been recently reduced by Babai and Sós to approximately \(9.5| Y|^ 3\).
Chris D. Godsil, Wilfried Imrich
openaire   +2 more sources

Graph Ear Decompositions and Graph Embeddings

SIAM Journal on Discrete Mathematics, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jianer Chen, Saroja P. Kanchi
openaire   +2 more sources

On Embedding Uncertain Graphs

Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, 2017
Graph data are prevalent in communication networks, social media, and biological networks. These data, which are often noisy or inexact, can be represented by uncertain graphs, whose edges are associated with probabilities to indicate the chances that they exist.
Jiafeng Hu, Reynold Cheng, Zhipeng Huang 0001, Yixiang Fang, Siqiang Luo   +4 more
openaire   +2 more sources

The embeddings of a graph—A survey

Journal of Graph Theory, 1978
AbstractTopological graph theory seeks to find answers to the question of how graphs map into surfaces. This paper surveys the information now available about the range of a graph, namely, the set of surfaces on which the graph can be “neatly” embedded.
openaire   +2 more sources

Embeddings of bipartite graphs

Journal of Graph Theory, 1983
AbstractIf G is a bipartite graph with bipartition A, B then let Gm,n(A, B) be obtained from G by replacing each vertex a of A by an independent set a1, …, am, each vertex b of B by an independent set b1,…, bn, and each edge ab of G by the complete bipartite graph with edges aibj (1 ≤ i ≤ m and 1 ≤ j ≤ n).
Mohammed Abu-Sbeih, Torrence D. Parsons
openaire   +2 more sources

Embedding graphs onto the Supercube

IEEE Transactions on Computers, 1995
Summary: We consider the supercube, a new interconnection network derived from the hypercube. The supercube, introduced by Sen, has the same diameter and connectivity as a hypercube but can be realized for any number of nodes, not only powers of 2. We study the supercube's ability to execute parallel programs, using graph-embedding techniques.
AULETTA, Vincenzo, RESCIGNO, Adele Anna, SCARANO, Vittorio   +2 more
openaire   +2 more sources