Results 241 to 250 of about 287,840 (285)
Some of the next articles are maybe not open access.
Simultaneous Embedding of Embedded Planar Graphs
International Journal of Computational Geometry & Applications, 2011A 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.
ANGELINI, PATRIZIO +2 more
openaire +3 more sources
Projective Nonnegative Graph Embedding
IEEE Transactions on Image Processing, 2010We present in this paper a general formulation for nonnegative data factorization, called projective nonnegative graph embedding (PNGE), which 1) explicitly decomposes the data into two nonnegative components favoring the characteristics encoded by the so-called intrinsic and penalty graphs , respectively, and 2) explicitly describes how to transform ...
Liu, X., Yan, S., Jin, H.
openaire +2 more sources
Contrastive graph auto-encoder for graph embedding
Neural Networks, 2023Graph embedding aims to embed the information of graph data into low-dimensional representation space. Prior methods generally suffer from an imbalance of preserving structural information and node features due to their pre-defined inductive biases, leading to unsatisfactory generalization performance.
Shuaishuai Zu +3 more
openaire +2 more sources
Embedding Graph Auto-Encoder for Graph Clustering
IEEE Transactions on Neural Networks and Learning Systems, 2023Graph clustering, aiming to partition nodes of a graph into various groups via an unsupervised approach, is an attractive topic in recent years. To improve the representative ability, several graph auto-encoder (GAE) models, which are based on semisupervised graph convolution networks (GCN), have been developed and they have achieved impressive results
Hongyuan Zhang +3 more
openaire +2 more sources
Graph Ear Decompositions and Graph Embeddings
SIAM Journal on Discrete Mathematics, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chen, Jianer, Kanchi, Saroja P.
openaire +1 more source
Fuzzy multilevel graph embedding
Pattern Recognition, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Luqman, Muhammad Muzzamil +3 more
openaire +3 more sources
Embedding graphs onto the Supercube
IEEE Transactions on Computers, 1995Summary: 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 +2 more
openaire +2 more sources
Robust (Semi) Nonnegative Graph Embedding
IEEE Transactions on Image Processing, 2014Nonnegative matrix factorization (NMF) has received considerable attention in image processing, computer vision, and patter recognition. An important variant of NMF is nonnegative graph embedding (NGE), which encodes the statistical or geometric information of data in the process of matrix factorization.
Zhang, Hanwang +4 more
openaire +3 more sources
Embedding graphs in Cayley graphs
Graphs and Combinatorics, 1987Over 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\).
Godsil, Chris D., Imrich, Wilfried
openaire +2 more sources