Results 11 to 20 of about 12,131,917 (294)

Parameterized Algorithms for Book Embedding Problems [PDF]

open access: yesJournal of Graph Algorithms and Applications, 2019
A k-page book embedding of a graph G draws the vertices of G on a line and the edges on k half-planes (called pages) bounded by this line, such that no two edges on the same page cross.
Montecchiani F.   +7 more
core   +8 more sources

Topological Book Embedding of Bipartite Graphs

open access: yesIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2006
A topological book embedding of a graph is an embedding in a book that carries the vertices in the spine of the book and the edges in the pages so that edges are allowed to cross the spine.
Miki Miyauchi
core   +3 more sources

The Disc Embedding Theorem

open access: yes, 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   +7 more sources

On dispersable book embeddings [PDF]

open access: yesTheoretical Computer Science, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Muhammad Jawaherul Alam   +5 more
openaire   +6 more sources

Computing upward topological book embeddings of upward planar digraphs [PDF]

open access: yes, 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

Upward Partitioned Book Embeddings [PDF]

open access: yes, 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

open access: yesHyperrhiz, 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

A best-fit solution: transforming an NHS Library and Knowledge Service in readiness for a new hospital building without a traditional library space

open access: yesJournal 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

Research on Recommendation Algorithm of Joint Light Graph Convolution Network and DropEdge

open access: yesJournal 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

ISART: A Generic Framework for Searching Books with Social Information. [PDF]

open access: yesPLoS 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

Home - About - Disclaimer - Privacy