Results 11 to 20 of about 3,644,444 (342)
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 +2 more sources
Advancements on SEFE and Partitioned Book Embedding problems [PDF]
Theoretical Computer Science, 2015 29 pages, 10 figures, extended version of 'On Some NP-complete SEFE Problems' (Eighth International Workshop on Algorithms and Computation, 2014)
Patrizio Angelini +2 more
openaire +5 more sources
Aligning Books and Movies: Towards Story-Like Visual Explanations by Watching Movies and Reading Books [PDF]
IEEE International Conference on Computer Vision, 2015 Books are a rich source of both fine-grained information, how a character, an object or a scene looks like, as well as high-level semantics, what someone is thinking, feeling and how these states evolve through a story.
Fidler, Sanja +6 more
core +5 more sources
Two-Page Book Embeddings of 4-Planar Graphs [PDF]
Algorithmica, 2014 21 pages, 16 Figures.
Michael A. Bekos +2 more
openalex +6 more sources
On Open Book Embedding of Contact Manifolds in the Standard Contact Sphere [PDF]
Canadian mathematical bulletin, 2019 We prove some open book embedding results in the contact category with a constructive approach. As a consequence, we give an alternative proof of a theorem of Etnyre and Lekili that produces a large class of contact 3-manifolds admitting contact open ...
Kuldeep Saha
openalex +3 more sources
The book embedding of ordered sets
, 2005 A large number of important problems in different areas can be expressed as graph layout problems whose objective is to determine a linear layout in such way that a certain objective cost is optimized. In a book embedding for an ordered set, the elements are embedded on the spine of the book to form a linear extension.
Mustafa Alhashem
openalex +3 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
Book Review: Embeddings in manifolds [PDF]
Bulletin of the American Mathematical Society, 2011 J. W. Cannon
openalex +3 more sources
Upward Book Embeddability of st-Graphs: Complexity and Algorithms [PDF]
Algorithmica, 2023 A k-page upward book embedding (kUBE) of a directed acyclic graph G is a book embeddings of G on k pages with the additional requirement that the vertices appear in a topological ordering along the spine of the book.
Carla Binucci +5 more
openalex +2 more sources