Results 1 to 10 of about 3,607,019 (216)
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
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, Kuldeep Saha
openalex +3 more sources
Parameterized Algorithms for Book Embedding Problems [PDF]
International Symposium Graph Drawing and Network Visualization, 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.
Sujoy Bhore +3 more
openalex +2 more sources
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
Semantic Dependency Parsing via Book Embedding [PDF]
Annual Meeting of the Association for Computational Linguistics, 2017 We model a dependency graph as a book, a particular kind of topological space, for semantic dependency parsing. The spine of the book is made up of a sequence of words, and each page contains a subset of noncrossing arcs.
Weiwei Sun, Junjie Cao, Xiaojun Wan
openalex +2 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
Upward Book Embeddings of st-Graphs [PDF]
International Symposium on Computational Geometry, 2019 We study $k$-page upward book embeddings ($k$UBEs) of $st$-graphs, that is, book embeddings of single-source single-sink directed acyclic graphs on $k$ pages with the additional requirement that the vertices of the graph appear in a topological ordering ...
Carla Binucci +5 more
openalex +2 more sources
IEEE AccessBook recommendations are crucial in digital library transformation, enhancing service sophistication and customization. They allow readers to access books tailored to their specific interests.
Yafeng Kong
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
Realised Volatility Forecasting: Machine Learning via Financial Word Embedding [PDF]
Social Science Research Network, 2021 We develop FinText, a novel, state-of-the-art, financial word embedding from Dow Jones Newswires Text News Feed Database. Incorporating this word embedding in a machine learning model produces a substantial increase in volatility forecasting performance ...
Eghbal Rahimikia, Stefan Zohren, S. Poon
semanticscholar +1 more source