Results 11 to 20 of about 649,217 (300)
Enumeration of graph embeddings [PDF]
Discrete Mathematics, 1994 Let \(G\) be a finite connected simple graph, with \(\Gamma\) a subgroup of \(\Aut G\). Two 2-cell imbeddings \(i: G\to S\) and \(j: G\to S\) of \(G\) into a closed surface \(S\) (orientable or nonorientable) are said to be congruent with respect to \(\Gamma\) if there exist a surface homeomorphism \(h: S\to S\) and a \(\gamma\in \Gamma\) such that \(h\
KWAK, JH, LEE, J
openaire +4 more sources
Algorithmic graph embeddings [PDF]
Theoretical Computer Science, 1997 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chen, Jianer
openaire +4 more sources
On a class of metrics related to graph layout problems [PDF]
, 2010 We examine the metrics that arise when a finite set of points is embedded in the real line, in such a way that the distance between each pair of points is at least 1.
Theis, D O +3 more
core +5 more sources
Embedding Graphs into Embedded Graphs [PDF]
Algorithmica, 2020 A (possibly denerate) drawing of a graph $G$ in the plane is approximable by an embedding if it can be turned into an embedding by an arbitrarily small perturbation. We show that testing, whether a straight-line drawing of a planar graph $G$ in the plane is approximable by an embedding, can be carried out in polynomial time, if a desired embedding of ...
openaire +6 more sources
Embedding a Forest in a Graph [PDF]
The Electronic Journal of Combinatorics, 2011 For $p\ge 1$, we prove that every forest with $p$ trees whose sizes are $a_1, \ldots, a_p$ can be embedded in any graph containing at least $\sum_{i=1}^p (a_i + 1)$ vertices and having minimum degree at least $\sum_{i=1}^p a_i$.
Mark K. Goldberg, Malik Magdon-Ismail
openaire +4 more sources
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019 We propose the Graph Space Embedding (GSE), a technique that maps the input into a space where interactions are implicitly encoded, with little computations required. We provide theoretical results on an optimal regime for the GSE, namely a feasibility region for its parameters, and demonstrate the experimental relevance of our findings.
João P. B. Pereira +3 more
openaire +3 more sources
Future Internet, 2023 Educational content recommendation is a cornerstone of AI-enhanced learning. In particular, to facilitate navigating the diverse learning resources available on learning platforms, methods are needed for automatically linking learning materials, e.g., in
Xiu Li +4 more
doaj +1 more source
On Embeddings of Circulant Graphs [PDF]
The Electronic Journal of Combinatorics, 2015 A circulant of order $n$ is a Cayley graph for the cyclic group $\mathbb{Z}_n$, and as such, admits a transitive action of $\mathbb{Z}_n$ on its vertices. This paper concerns 2-cell embeddings of connected circulants on closed orientable surfaces.
Conder, Marston, Grande, Ricardo
openaire +4 more sources
CKGAT: Collaborative Knowledge-Aware Graph Attention Network for Top-N Recommendation
Applied Sciences, 2022 Knowledge graph-based recommendation methods are a hot research topic in the field of recommender systems in recent years. As a mainstream knowledge graph-based recommendation method, the propagation-based recommendation method captures users’ potential ...
Zhuoming Xu +4 more
doaj +1 more source
Embeddings of 3-connected 3-regular planar graphs on surfaces of non-negative Euler characteristic [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 Whitney's theorem states that every 3-connected planar graph is uniquely embeddable on the sphere. On the other hand, it has many inequivalent embeddings on another surface. We shall characterize structures of a $3$-connected $3$-regular planar graph $G$
Kengo Enami
doaj +1 more source