Results 1 to 10 of about 7,117 (143)
On the optimal layout of (K p − C p ) n into grid and certain structures [PDF]
Scientific ReportsInterconnection networks constitute complex configurations of processors and communication links that facilitate data transmission between processors in a parallel computing system.
G. Caroline Vincy, David Raj Micheal
doaj +2 more sources
KGRec: A knowledge graph attention-based model for recommender system. [PDF]
PLoS ONERecommender systems have recently gained significant traction as powerful tools for personalized content delivery. While accuracy remains a key focus, users now expect more than precise suggestions.
Trinh Duong Hoan, Bui Thanh Hung
doaj +2 more sources
A graph neural network recommendation algorithm based on multi-scale attention and contrastive learning [PDF]
Scientific ReportsWhen facing sparse user–item interaction data, recommendation systems often struggle to learn high-quality representations, which in turn affects the recommendation performance.
Dongqi Pu +4 more
doaj +2 more sources
On dispersable book embeddings [PDF]
Theoretical Computer Science, 2021 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alam, Jawaherul Md. +5 more
openaire +5 more sources
Matching book thickness of generalized Petersen graphs
Electronic Journal of Graph Theory and Applications, 2022 The matching book embedding of a graph G is to place its vertices on the spine, and arrange its edges on the pages so that the edges in the same page do not intersect each other and the edges induced subgraphs of each page are 1-regular.
Zeling Shao, Huiru Geng, Zhiguo Li
doaj +1 more source
Discrete Mathematics & Theoretical Computer Science, 2004 A \emph(k,t)-track layout of a graph G consists of a (proper) vertex t-colouring of G, a total order of each vertex colour class, and a (non-proper) edge k-colouring such that between each pair of colour classes no two monochromatic edges cross.
Vida Dujmović +2 more
doaj +1 more source
Stacks, Queues and Tracks: Layouts of Graph Subdivisions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 A \emphk-stack layout (respectively, \emphk-queuelayout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges with respect to the vertex ordering.
Vida Dujmović, David R. Wood
doaj +1 more source
On Linear Layouts of Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2004 In a total order of the vertices of a graph, two edges with no endpoint in common can be \emphcrossing, \emphnested, or \emphdisjoint. A \emphk-stack (respectively, \emphk-queue, \emphk-arch) \emphlayout of a graph consists of a total order of the ...
Vida Dujmović, David R. Wood
doaj +1 more source
Upward Partitioned Book Embeddings [PDF]
, 2018 We analyze a directed variation of the book embedding problem when the page partition is prespecified and the nodes on the spine must be in topological order (upward book embedding). Given a directed acyclic graph and a partition of its edges into $k$ pages, can we linearly order the vertices such that the drawing is upward (a topological sort) and ...
Akitaya, Hugo A. +3 more
openaire +5 more sources
Follow the Pathfinders: a Case Study Approach to Production, Use, and Readership on Scalar
Hyperrhiz, 2021 This born-digital article examines the multimodal academic publication Pathfinders (Moulthrop and Grigar). Through a combination of interviews with readers and the author, textual analysis of the book, and literature review of Scalar, I trace the ...
Hannah Ackermans
doaj +1 more source