Results 21 to 30 of about 11,283 (285)
Journal of the Medical Library Association, 2021 Background: Over a decade ago, the Hill report argued that a shift in vision was required to change the perception of National Health Service (NHS) Library and Knowledge Services (LKS) in England from “book repositories” to essential services that ...
Rebecca Jean Scott
doaj +1 more source
ISART: A Generic Framework for Searching Books with Social Information. [PDF]
PLoS ONE, 2016 Effective book search has been discussed for decades and is still future-proof in areas as diverse as computer science, informatics, e-commerce and even culture and arts.
Xu-Cheng Yin +7 more
doaj +1 more source
A Tight Subexponential-Time Algorithm for Two-Page Book Embedding [PDF]
A book embedding of a graph is a drawing that maps vertices onto a line and edges to simple pairwise non-crossing curves drawn into “pages”, which are half-planes bounded by that line.
Ordyniak, Sebastian; orcid: +4 more
core +7 more sources
Two-page book embedding of trees under vertex-neighborhood constraints [PDF]
, 1993 We study the VLSI-related problem of embedding graphs in books. A book embedding of a graph G=(V,E) consists of two parts, namely, (1) an ordering of V along the spine of the book, and (2) an assignment of each eϵE to a page of the book, so that edges ...
Moran, Shlomo +3 more
core +1 more source
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 +2 more sources
Implementing a Partitioned 2-Page Book Embedding Testing Algorithm [PDF]
, 2013 In a book embedding the vertices of a graph are placed on the "spine" of a "book" and the edges are assigned to "pages" so that edges on the same page do not cross. In the Partitioned 2-page Book Embedding problem egdes are partitioned into two sets $E_1$
Angelini, Patrizio +5 more
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
Carla Binucci +5 more
openaire +5 more sources