Results 11 to 20 of about 11,283 (285)
Handbook of clausal embedding [PDF]
, 2023 The fact that we can embed one clause within another, as in this very sentence, is a curious property of human language. On the one hand, clauses express complete thoughts and can be used to perform separate speech acts; on the other, they can be ...
Lander, Eric T. +35 more
core +19 more sources
The Disc Embedding Theorem [PDF]
, 2021 Based on Fields medal winning work of Michael Freedman, this book explores the disc embedding theorem for 4-dimensional manifolds. This theorem underpins virtually all our understanding of topological 4-manifolds.
core +3 more sources
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
Computing upward topological book embeddings of upward planar digraphs [PDF]
, 2007 This paper studies the problem of computing an upward topological book embedding of an upward planar digraph G, i.e. a topological book embedding of G where all edges are monotonically increasing in the upward direction.
Liotta, G +7 more
core +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
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 +4 more sources
Four pages are indeed necessary for planar graphs
Journal of Computational Geometry, 2020 An embedding of a graph in a book consists of a linear order of its vertices along the spine of the book and of an assignment of its edges to the pages of the book, so that no two edges on the same page cross. The book thickness of a graph is the minimum
Michael Kaufmann +5 more
doaj +1 more source
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
Book embedding of the k-ary hypercube [PDF]
, 2008 Graph embeddings play an important role in interconnection network and VLSI design. Determining the number of layers required to build a VLSI chip is just one of the many areas in which graph embeddings are used.
Said Bettayeb +3 more
core +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