Results 11 to 20 of about 7,209 (302)
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
Steganography via E-Books With the EPUB Format by Rearrangements of the Contents of the CSS Files
IEEE Access, 2020 With the advance of information technology and mobile devices, e-book reading has become a popular way for people to gain knowledge. However, with the widespread uses of digital texts, issues about the copyright protection of e-books have arisen.
Da-Chun Wu, Hsiu-Yang Su
doaj +1 more source
Research on Recommendation Algorithm of Joint Light Graph Convolution Network and DropEdge
Journal of Advanced Transportation, 2022 Overfitting in a deep neural network leads to low recommendation precision and high loss. To mitigate these issues in a deep neural network-based recommendation algorithm, we propose a recommendation algorithm, LG-DropEdge, joint light graph ...
Haicheng Qu, Jiangtao Guo, Yanji Jiang
doaj +1 more source
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