Results 21 to 30 of about 12,131,917 (294)
Book Embeddings of Graph Products
CoRR, 2020 A $k$-stack layout (also called a $k$-page book embedding) of a graph consists of a total order of the vertices, and a partition of the edges into $k$ sets of non-crossing edges with respect to the vertex order. The stack number (book thickness, page number) of a graph is the minimum $k$ such that it admits a $k$-stack layout.
openaire +3 more sources
Nonlinear Dynamic Field Embedding: On Hyperspectral Scene Visualization [PDF]
, 2012 In many areas of research, complex signals are commonly represented by high dimensional feature vectors. However, high dimensional vectors are difficult to analyze and interpret due to the curse of dimensionality.
Lunga, Dalton, Erosy, Okan
core +1 more source
Multitask feature learning approach for knowledge graph enhanced recommendations with RippleNet.
PLoS ONE, 2021 Introducing a knowledge graph into a recommender system as auxiliary information can effectively solve the sparse and cold start problems existing in traditional recommender systems. In recent years, many researchers have performed related work.
YueQun Wang +3 more
doaj +1 more source
When are the natural embeddings of classical invariant rings pure?
Forum of Mathematics, Sigma, 2023 Consider a reductive linear algebraic group G acting linearly on a polynomial ring S over an infinite field; key examples are the general linear group, the symplectic group, the orthogonal group, and the special linear group, with the classical ...
Melvin Hochster +3 more
doaj +1 more source
Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs
Journal of Graph Algorithms and Applications, 2011 Given an embedded planar acyclic digraph G, we define the problem of acyclic hamiltonian path completion with crossing minimization (acyclic-HPCCM) to be the problem of determining a hamiltonian path completion set of edges such that, when these edges ...
Tamara Mchedlidze, Antonios Symvonis
doaj +1 more source
Upward Book Embeddings of st-Graphs
CoRR, 2019 We study $k$-page upward book embeddings ($k$UBEs) of $st$-graphs, that is, book embeddings of single-source single-sink directed acyclic graphs on $k$ pages with the additional requirement that the vertices of the graph appear in a topological ordering along the spine of the book. We show that testing whether a graph admits a $k$UBE is NP-complete for
Binucci C. +5 more
openaire +5 more sources
Reversible watermarking scheme with image-independent embedding capacity [PDF]
, 2005 Permanent distortion is one of the main drawbacks of all the irreversible watermarking schemes. Attempts to recover the original signal after the signal passing the authentication process are being made starting just a few years ago. Some common problems,
C.-T. Li, Li, Chang-Tsun
core +1 more source
Book Embeddings and Point-Set Embeddings of Series-Parallel Digraphs [PDF]
, 2002 An optimal O(n)-time algorithm to compute an upward two-page book embedding of a series-parallel digraph with n vertices is presented. A previous algorithm of Alzohairi and Rival [1] runs in O(n3) time and assumes that the input series-parallel digraph does not have transitive edges.
DI GIACOMO, Emilio +3 more
openaire +4 more sources
Monotone Arc Diagrams with few Biarcs
Journal of Graph Algorithms and ApplicationsWe show that every planar graph has a monotone topological 2-page book embedding, also known as a monotone arc diagram, where at most $(4n-10)/5$ (of potentially $3n-6$) edges cross the spine, and every edge crosses the spine at most once; such an edge ...
Steven Chaplick +3 more
doaj +1 more source
On the Genus of the Idempotent Graph of a Finite Commutative Ring
Discussiones Mathematicae - General Algebra and Applications, 2021 Let R be a finite commutative ring with identity. The idempotent graph of R is the simple undirected graph I(R) with vertex set, the set of all nontrivial idempotents of R and two distinct vertices x and y are adjacent if and only if xy = 0.
Belsi G. Gold, Kavitha S., Selvakumar K.
doaj +1 more source